Systems and methods for generating encoded representations for multiple magnifications of image data

ABSTRACT

Computer-implemented methods and systems are provided for generating encoded representations for multiple magnifications of one or more query images. An example method for involves operating a processor to obtain a query image and identify a set of anchor points within the query image. The processor is operable to generate a plurality of sub-images for a plurality of magnification levels for each anchor point. Each sub-image includes the anchor point and corresponds to a magnification level of the plurality of magnification levels. The processor is operable to, for each magnification level, apply an artificial neural network model to a group of sub-images having that magnification level to extract a feature vector representative of image characteristics of the query image at that magnification level; and to generate an encoded representation for multiple magnifications of the query image based on the feature vectors extracted for the plurality of magnification levels.

CROSS-REFERENCE TO RELATED PATENT APPLICATIONS

This application is a continuation of U.S. patent application Ser. No.17/534,693, filed Nov. 24, 2021, which claims priority from U.S.Provisional Patent Application No. 63/117,636, filed Nov. 24, 2020. Theentire content of each of U.S. Provisional Patent Application No.63/117,636 and U.S. patent application Ser. No. 17/534,693 is hereinincorporated by reference for all purposes.

FIELD

The described embodiments relate to systems and methods of managingimage data and in particular, systems and methods of generating encodedrepresentations of image data.

BACKGROUND

Digital images and videos are increasingly common forms of media. Asmore digital content is generated and becomes available, the usefulnessof that digital content largely depends on its management.

Some existing practices involve associating the digital content withsearchable descriptors. Although some of these descriptors may beautomatically generated, these descriptors are typically generated basedon features and/or qualities identified from human observations andjudgement. In addition to the amount of time required for a human toobserve and generate descriptive descriptors for the digital content,the descriptors may not be universal or adaptable between differentsystems. Also, existing descriptors can be limited by the extent inwhich the digital content can be processed.

SUMMARY

The various embodiments described herein generally relate to methods(and associated systems configured to implement the methods) ofgenerating encoded representations for multiple magnifications of one ormore query images.

An example method can involve operating a processor to, for each queryimage, obtain the query image having an initial magnification level;identify a set of anchor points within the query image; and generate aplurality of sub-images for a plurality of magnification levels for eachanchor point of the set of anchor points. Each sub-image can include theanchor point and correspond to a magnification level of the plurality ofmagnification levels. The method can also involve operating theprocessor to apply an artificial neural network model to a group ofsub-images for each magnification level of the plurality ofmagnification levels to extract a feature vector representative of imagecharacteristics of the query image at that magnification level. Themethod can also involve operating the processor to generate an encodedrepresentation for multiple magnifications of the query image based onthe feature vectors extracted for the plurality of magnification levels.

In some embodiments, each sub-image of the plurality of sub-images forthe plurality of magnification levels can consist of an equal number ofpixels as other sub-images of the plurality of sub-images.

In some embodiments, each sub-image of the plurality of sub-images forthe plurality of magnification levels can include same dimensions asother sub-images of the plurality of sub-images, the dimensions beingcharacterized by pixels.

In some embodiments, each sub-image of the plurality of sub-images foran anchor point can correspond to a portion of the query image having adifferent area size than another sub-image for the anchor point.

In some embodiments, at least a portion of each sub-image of theplurality of sub-images for an anchor point can correspond to the sameportion of the query image as the other sub-images of the plurality ofsub-images for that anchor point.

In some embodiments, the method can involve sampling at least a portionof the query image to obtain one or more versions of at least theportion of the query image having a magnification level less than theinitial magnification level.

In some embodiments, the method can involve dividing the portion of thequery image into subsets of pixels; and for each subset of pixels,generating one or more representative pixels for representing the subsetof pixels, the representative pixels being fewer than the subset ofpixels.

In some embodiments, for each subset of pixels, the one or morerepresentative pixels can include one representative pixel.

In some embodiments, for each subset of pixels, an intensity level ofthe representative pixel can include an average of intensity levels ofthe pixels of the subset of pixels.

In some embodiments, the average of the intensity levels of the pixelsof the subset of pixels can include the mean of the intensity levels ofpixels of the subset of pixels.

In some embodiments, the method can involve sampling the query image toobtain one or more versions of the query image. Each version of thequery image can have a magnification level of the plurality ofmagnification levels. Identifying the set of anchor points within thequery image can involve identifying a set of anchor points within eachof the one or more versions of the query image. Generating the pluralityof sub-images for the plurality of magnification levels for each anchorpoint of the set of anchor points can involve generating a sub-image foreach anchor point of the set of anchor points from each of the one ormore versions of the query images.

In some embodiments, the method involve generating a plurality ofinitial sub-images from the query image and sampling each initialsub-image to obtain a version of the initial sub-image. Each initialsub-image of the plurality of initial sub-images can have the initialmagnification level. Each version of the sub-image can have amagnification level of the plurality of magnification levels.

In some embodiments, each initial sub-image of the plurality of initialsub-images can consists of a different number of pixels than anothersub-image for the anchor point.

In some embodiments, each initial sub-image of the plurality of initialsub-images can include different dimensions than another sub-image forthe anchor point, the dimensions being characterized by pixels.

In some embodiments, each initial sub-image of the plurality of initialsub-images for an anchor point can correspond to a portion of the queryimage having a different area size than another initial sub-image forthe anchor point.

In some embodiments, the method can involve generating a plurality ofconcentric sub-images for the plurality of magnification.

In some embodiments, the method can involve using the anchor point as acenter point of each sub-image of the plurality of sub-images for theplurality of magnification levels.

In some embodiments, the method can involve repeatedly pooling andconvoluting the group of sub-images to extract and aggregate featurevectors for that magnification level, and compressing the featurevectors for that magnification level to obtain a feature vector for thatmagnification level.

In some embodiments, sub-images having different magnification levelscan be repeatedly pooled and convoluted in parallel.

In some embodiments, sub-images having different magnification levelscan be repeatedly pooled and convoluted in sequence.

In some embodiments, the method can involve concatenating the featurevectors extracted for each magnification level together.

In some embodiments, the method can involve classifying the featurevector for that magnification level to obtain a classification of imagecharacteristics of the query image at that magnification level.

In some embodiments, the method can involve applying one or more fullyconnected neural network layers to the feature vector obtained for thatmagnification level.

In some embodiments, the method can involve concatenating the featurevector for each magnification of the plurality of magnificationstogether.

In some embodiments, the method can involve, for each magnificationlevel of the plurality of magnification levels, reducing a number offeature vectors for that magnification level.

In some embodiments, the method can involve identifying a median featurevector to represent a plurality of feature vectors.

In some embodiments, the method can involve clustering a plurality offeature vectors into a plurality of clusters and selecting a subset offeature vectors from each cluster of the plurality of clusters torepresent the plurality of feature vectors.

In some embodiments, the method can involve combining feature vectorsfor a magnification level to obtain a feature vector for amagnification.

In some embodiments, the method can involve using at least one ofprincipal component analysis, autoencoding, or evolutionaryoptimization.

In some embodiments, the method can involve generating a set ofpreliminary sub-images and, for each preliminary sub-image of the set ofpreliminary sub-images, identifying an anchor point from the preliminarysub-image to provide the set of anchor points. A relationship betweeneach anchor point and a respective sub-image can be same.

In some embodiments, the plurality of magnification levels can include asubset of magnification levels selected from: 5×, 10×, 20×, 40×, 75×,85×, and 100×.

In some embodiments, the plurality of magnification levels can includean initial magnification level, a second magnification level that is ahalf of the initial magnification level, and a third magnification levelthat is a quarter of the initial magnification level.

In some embodiments, each sub-image can have a square shape.

In some embodiments, the method can involve retrieving the query imagestored in a pyramidal format.

In some embodiments, the method can involve operating the processor toobtain the one or more query images from an imaging device.

In some embodiments, the one or more images can include one or moremedical images.

In another broad aspect, a system for generating encoded representationsfor multiple magnifications of one or more query images is disclosedherein. The system can include a communication component and a processorin communication with the communication component. The communicationcomponent can provide access to the one or more images via a network.The processor can be operable to, for each query image, obtain the queryimage having an initial magnification level; identify a set of anchorpoints within the query image; and generate a plurality of sub-imagesfor a plurality of magnification levels for each anchor point of the setof anchor points. Each sub-image can include the anchor point andcorrespond to a magnification level of the plurality of magnificationlevels. The processor can also be operable to apply an artificial neuralnetwork model to a group of sub-images for each magnification level ofthe plurality of magnification levels to extract a feature vectorrepresentative of image characteristics of the query image at thatmagnification level and generate an encoded representation for multiplemagnifications of the query image based on the feature vectors extractedfor the plurality of magnification levels.

In some embodiments, each sub-image of the plurality of sub-images forthe plurality of magnification levels can consist of an equal number ofpixels as other sub-images of the plurality of sub-images.

In some embodiments, each sub-image of the plurality of sub-images forthe plurality of magnification levels can include same dimensions asother sub-images of the plurality of sub-images, the dimensions beingcharacterized by pixels.

In some embodiments, each sub-image of the plurality of sub-images foran anchor point can correspond to a portion of the query image having adifferent area size than another sub-image for the anchor point.

In some embodiments, at least a portion of each sub-image of theplurality of sub-images for an anchor point can correspond to the sameportion of the query image as the other sub-images of the plurality ofsub-images for that anchor point.

In some embodiments, the processor can be operable to sample at least aportion of the query image to obtain one or more versions of at leastthe portion of the query image having a magnification level less thanthe initial magnification level.

In some embodiments, the processor can be operable to divide the portionof the query image into subsets of pixels; and for each subset ofpixels, generate one or more representative pixels for representing thesubset of pixels. The representative pixels can be fewer than the subsetof pixels.

In some embodiments, for each subset of pixels, the one or morerepresentative pixels can include one representative pixel.

In some embodiments, for each subset of pixels, an intensity level ofthe representative pixel can include an average of intensity levels ofthe pixels of the subset of pixels.

In some embodiments, the average of the intensity levels of the pixelsof the subset of pixels can include the mean of the intensity levels ofpixels of the subset of pixels.

In some embodiments, sampling at least the portion of the query imagecan involve sampling the query image to obtain one or more versions ofthe query image. Each version of the query image can have amagnification level of the plurality of magnification levels.Identifying the set of anchor points within the query image can involveidentifying a set of anchor points within each of the one or moreversions of the query image. Generating a plurality of sub-images forthe plurality of magnification levels for each anchor point of the setof anchor points can involve generating a sub-image for each anchorpoint of the set of anchor points from each of the one or more versionsof the query images.

In some embodiments, generating the plurality of sub-images for theplurality of magnification levels for each anchor point of the set ofanchor points can involve: generating a plurality of initial sub-imagesfrom the query image, each initial sub-image of the plurality of initialsub-images having the initial magnification level; and sampling eachinitial sub-image to obtain a version of the initial sub-image, eachversion of the sub-image having a magnification level of the pluralityof magnification levels.

In some embodiments, each initial sub-image of the plurality of initialsub-images can consist of a different number of pixels than anothersub-image for the anchor point.

In some embodiments, each initial sub-image of the plurality of initialsub-images can include different dimensions than another sub-image forthe anchor point, the dimensions being characterized by pixels.

In some embodiments, each initial sub-image of the plurality of initialsub-images for an anchor point can correspond to a portion of the queryimage having a different area size than another initial sub-image forthe anchor point.

In some embodiments, the processor can be operable to generate aplurality of concentric sub-images for the plurality of magnificationlevels.

In some embodiments, the processor can be operable to use the anchorpoint as a center point of each sub-image of the plurality of sub-imagesfor the plurality of magnification levels.

In some embodiments, the processor can be operable to repeatedly pooland convolute the group of sub-images to extract and aggregate featurevectors for that magnification level, and compress the feature vectorsfor that magnification level to obtain a feature vector for thatmagnification level.

In some embodiments, sub-images having different magnification levelscan be repeatedly pooled and convoluted in parallel.

In some embodiments, sub-images having different magnification levelscan be repeatedly pooled and convoluted in sequence.

In some embodiments, the processor can be operable to concatenate thefeature vectors extracted for each magnification level together.

In some embodiments, the processor can be operable to classify thefeature vector for that magnification level to obtain a classificationof image characteristics of the query image at that magnification level.

In some embodiments, the processor can be operable to apply one or morefully connected neural network layers to the feature vector obtained forthat magnification level.

In some embodiments, the processor can be operable to concatenate thefeature vector for each magnification of the plurality of magnificationstogether.

In some embodiments, the processor can be operable to, for eachmagnification level of the plurality of magnification levels, reduce anumber of feature vectors for that magnification level.

In some embodiments, the processor can be operable to identify a medianfeature vector to represent a plurality of feature vectors.

In some embodiments, the processor can be operable to cluster aplurality of feature vectors into a plurality of clusters and selectinga subset of feature vectors from each cluster of the plurality ofclusters to represent the plurality of feature vectors.

In some embodiments, the processor can be operable to combine featurevectors for a magnification level to obtain a feature vector for amagnification.

In some embodiments, the processor can be operable to use at least oneof principal component analysis, autoencoding, or evolutionaryoptimization.

In some embodiments, the processor can be operable to generate a set ofpreliminary sub-images and for each preliminary sub-image of the set ofpreliminary sub-images, identify an anchor point from the preliminarysub-image to provide the set of anchor points. A relationship betweeneach anchor point and a respective sub-image can be same.

In some embodiments, the plurality of magnification levels can include asubset of magnification levels selected from: 5×, 10×, 20×, 40×, 75×,85×, and 100×.

In some embodiments, the plurality of magnification levels can includean initial magnification level, a second magnification level that is ahalf of the initial magnification level, and a third magnification levelthat is a quarter of the initial magnification level.

In some embodiments, each sub-image can have a square shape.

In some embodiments, the processor can be operable to retrieve the queryimage stored in a pyramidal format.

In some embodiments, the processor can be operable to obtain the one ormore query images from an imaging device.

In some embodiments, the system can further include the imaging device.

In some embodiments, the one or more images can include one or moremedical images.

In another broad aspect, a method of generating an image identifier formultiple magnifications of one or more query images is disclosed herein.The method can involve operating a processor to, for each query image,obtain the query image having an initial magnification level andgenerate a plurality of sub-images for a plurality of magnificationlevels. Each sub-image can correspond to a magnification level of theplurality of magnification levels. The method can also involve operatingthe processor to apply an artificial neural network model to theplurality of sub-images to extract feature vectors representative ofimage characteristics of the query image at the plurality ofmagnification levels; and generate the image identifier for multiplemagnifications of the query image based on the feature vectors extractedfor the plurality of magnification levels.

In some embodiments, the method can further involve locating similarimages using the image identifier for multiple magnifications.

In some embodiments, using the image identifier for multiplemagnifications can involve using a portion of the image identifier formultiple magnifications as an image identifier for a singlemagnification.

In some embodiments, locating similar images using the image identifierfor multiple magnifications can involve: locating an initial set ofimages using a portion of the image identifier for multiplemagnifications as an image identifier for a single magnification, andlocating the similar images from the initial set of images using theimage identifier for multiple magnifications.

In another broad aspect, a system for generating an image identifier formultiple magnifications of one or more query images is disclosed herein.The system can include a communication component and a processor incommunication with the communication component. The communicationcomponent can provide access to the one or more images via a network.The processor can be operable to, for each query image, obtain the queryimage having an initial magnification level, and generate a plurality ofsub-images for a plurality of magnification levels. Each sub-image cancorrespond to a magnification level of the plurality of magnificationlevels; The processor can also be operable to extract feature vectorsrepresentative of image characteristics of the query image at theplurality of magnification levels from the plurality of sub-images, andgenerate the image identifier for multiple magnifications of the queryimage based on the feature vectors extracted from the plurality ofsub-images for the plurality of magnification levels.

In some embodiments, the processor can be further operable to locatesimilar images using the image identifier for multiple magnifications.

In some embodiments, the processor can be operable to use a portion ofthe image identifier for multiple magnifications as an image identifierfor a single magnification.

In some embodiments, the processor can be operable to locate an initialset of images using a portion of the image identifier for multiplemagnifications as an image identifier for a single magnification, andlocate the similar images from the initial set of images using the imageidentifier for multiple magnifications.

An example non-transitory computer-readable medium includinginstructions executable on a processor can implementing any one of themethods disclosed herein.

BRIEF DESCRIPTION OF THE DRAWINGS

Several embodiments will now be described in detail with reference tothe drawings, in which:

FIG. 1 is a block diagram of an image management system, in accordancewith an example embodiment;

FIG. 2 is a schematic for generating image identifiers for a pluralityof images, in accordance with an example embodiment;

FIG. 3 is a schematic for searching within a database to locate imageswith similar image data as a query image, in accordance with an exampleembodiment;

FIG. 4 is a flowchart of a method of generating encoded representationsfor multiple magnifications of one or more images, in accordance with anexample embodiment;

FIG. 5A is an illustration of an example set of preliminary sub-imagesof an example query image;

FIG. 5B is an illustration of an example set of anchor points of theexample query image of FIG. 5A;

FIG. 6 is an illustration of an example of a plurality of initialsub-images for an example anchor point of FIG. 5B;

FIG. 7 is an illustration of another example of a plurality of initialsub-images for another example anchor point of the example query imageof FIG. 5A;

FIG. 8A is an illustration of an example of a plurality of sub-imagesgenerated from a plurality of initial sub-images of FIG. 6 ;

FIG. 8B is an illustration of an example generation of a sub-image froman initial sub-image of FIG. 8A;

FIG. 8C is an illustration of an example generation of a sub-image fromanother initial sub-image of FIG. 8A;

FIG. 9A is an illustration of an example of a plurality of initialsub-images for the example set of anchor points of FIG. 5B;

FIG. 9B is an illustration of an example of a plurality of sub-imagesfor the example set of anchor points of FIG. 5B;

FIG. 10 is a block diagram of a method for generating encodedrepresentations for multiple magnifications of one or more images, inaccordance with an example embodiment;

FIG. 11 is a block diagram of a method for generating encodedrepresentations for multiple magnifications of one or more images, inaccordance with another example embodiment;

FIG. 12 is a block diagram of a method for generating encodedrepresentations for multiple magnifications of one or more images, inaccordance with another example embodiment;

FIG. 13 is a block diagram of a method for generating an encodedrepresentation based on feature vectors extracted for a plurality ofmagnification levels; and

FIG. 14 is a flowchart of an example method of locating images withsimilar image data as a query image, in accordance with an exampleembodiment.

The drawings, described below, are provided for purposes ofillustration, and not of limitation, of the aspects and features ofvarious examples of embodiments described herein. For simplicity andclarity of illustration, elements shown in the drawings have notnecessarily been drawn to scale. The dimensions of some of the elementsmay be exaggerated relative to other elements for clarity. It will beappreciated that for simplicity and clarity of illustration, whereconsidered appropriate, reference numerals may be repeated among thedrawings to indicate corresponding or analogous elements or steps.

DESCRIPTION OF EXAMPLE EMBODIMENTS

The various embodiments described herein generally relate to methods(and associated systems configured to implement the methods) forgenerating encoded representations of image data.

In the medical field, medical images of patients are regularly capturedfor diagnostic and/or monitoring purposes. Medical images can becaptured by many various different imaging devices and undergo visual ornumerical investigation for medical diagnoses and research. Modernpathology uses digital scanners to digitize microscopic images of biopsysamples on glass slides in high resolution. These images are called“whole slide images” (WSIs) and are generally large in size (i.e., canbe in the order of 100 megabytes and gigabytes).

Medical images are typically archived and may be retrieved for a laterpurpose (e.g., research or educational). Timely and consistent retrievalof archived images can likely assist with diagnosis. Similarly, manyother sectors, such as, but not limited to, architectural andengineering design, geoinformatics, museum and gallery collections,retail catalogs, material processing, military and defense applications,surveillance and forensics, can also benefit from efficient andconsistent management of image data.

The ability to efficiently identify archived images, and retrieve thoseimages can be advantageous for these example sectors, amongst others.For example, in the medical field, as medical images are analyzed for amedical diagnosis, the medical images can be compared with archivedimages of diagnosed cases to assist with the diagnosis. Also, thepresent diagnosis can benefit from archived images, which may have beenclinically evaluated and annotated for second opinions, research, oreducational purposes.

Existing practices involve associating images with image descriptorsthat are searchable to assist with the management of the image data.Although some of these existing image descriptors may be automaticallygenerated, they are typically generated based on features and/orqualities identified from human observations and judgement, such askeywords or tags. Such approaches requiring manual human annotation andjudgement can be impractical in view of the large amount of image andvideo data that typically needs to be processed. In addition to theamount of time required for a human to observe and generate descriptivedescriptors for the digital content, the descriptors may be inconsistentbetween medical facilities and equipment and may not be universal oradaptable between different systems.

In many image processing systems, the quality of the descriptors can belimited by the computer resources. Depending on the resolution of animage, existing image descriptors may be insufficient to accuratelyidentify similar images. Existing image descriptors can be complex andinvolve computationally intensive calculations. The computational powermay not readily be available and/or insufficient to handle the growingamount of digital content being generated. As well, the existing imagedescriptors can require large amount of storage capacity, which resultsin additional cost or may not be available at all.

Image characterization as used herein relates to representing imagecontent (i.e., histologic features) in a manner such that image data canbe accurately and efficiently processed and analyzed. Existing imagecharacterization methods can split an image into many smaller sub-images(i.e., tiles or patches) and process a subset or all of the sub-imagesto enable image analytics.

Sub-images are typically selected at a preset magnification. Forexample, many applications can select sub-images at a magnificationlevel of 20× or 40×. However, digital pathology can involve imageanalysis at magnification levels from 1× to 2.5×, 5×, 10×, 20× andhigher. For example, pathologists may repeatedly examine multiplemagnifications of the same specimen to better understand the specimen.This can involve transition between adjacent magnifications in order tosee image features at high magnifications, such as details, and at lowmagnifications such as, but not limited to, tissue structures. Viewingan image at multiple magnifications can be a challenge for computersespecially with respect to the large dimensions of the images.

Reference is first made to FIG. 1 , which illustrates an example blockdiagram 100 of an image management system 110 in communication with animaging device 120, a system storage component 140, and a computingdevice 150 via a network 130. Although only one imaging device 120 andone computing device 150 are shown in FIG. 1 , the image managementsystem 110 can be in communication with fewer or more imaging devices120 and fewer or more computing devices 150. The image management system110 can communicate with the devices 120, 150 over a wide geographicarea via the network 130.

The imaging device 120 can include any device capable of capturing imagedata and/or generating images, and/or storing image data. For example,the imaging device 120 can be a digital pathology scanner.

As shown in FIG. 1 , the image management system 110 includes aprocessor 112, a storage component 114, and a communication component116. The image management system 110 may include one or more serversthat may be distributed over a wide geographic area and connected viathe network 130. In some embodiments, each of the processor 112, thestorage component 114 and the communication component 116 may becombined into a fewer number of components or may be separated intofurther components.

The processor 112 may be any suitable processors, controllers, digitalsignal processors, graphics processing units, application specificintegrated circuits (ASICs), and/or field programmable gate arrays(FPGAs) that can provide sufficient processing power depending on theconfiguration, purposes and requirements of the image management system110. In some embodiments, the processor 112 can include more than oneprocessor with each processor being configured to perform differentdedicated tasks.

The processor 112 may be configured to control the operation of theimage management system 110. The processor 112 can include modules thatinitiate and manage the operations of the image management system 110.The processor 112 may also determine, based on received data, storeddata and/or user preferences, how the image management system 110 maygenerally operate.

The processor 112 can pre-process images. For example, the processor 112can operate to stitch frames received from the imaging device 120together to produce a whole slide image (i.e., digitized glass slide).The processor 112 can also, or alternatively, apply different processingtechniques to the frames, including, but not limited to, fieldflattening, de-Bayering, sharpening, de-noising, color correction, andcompression. The image management system 110 can then store the wholeslide image into the storage component 114, for example. The imagemanagement system 110 can receive the frames directly from the imagingdevice 120—that is, the pre-processing component can be optional.

The processor 112 can generate image identifiers for each image. Animage identifier can represent a content of the image that it isassociated with. That is, an image identifier represents at least aportion of the image data of that image. For example, the image data(e.g., select features and/or portions) can be translated by the imagemanagement system 110 into an encoded representation as the imageidentifier. For example, the image identifier can be a numericalrepresentation containing integer values and/or binary values.

By translating and storing the image data in association with imageidentifier, the processor 112 can then search the associated image databy searching a database of the associated image identifiers. Forexample, the processor 112 can compare and retrieve similar or relatedimages by searching a database of the associated image identifiers. Thedatabase of the associated image identifiers can include a set of imageidentifiers for images for the purpose of comparison with other imageshaving image identifiers. Typically, the database of image identifiersrelates to images of the same modality. For example, a database of imageidentifiers can relate to human anatomical histopathology whole slideimages with hematoxylin and eosin (H&E) staining. Each set of imageidentifiers defined for an image can be a function of the type andcontent of the image. A set of image identifiers can include one or moreimage identifiers. In some embodiments, a set of image identifiers caninclude hundreds of image identifiers for an image.

When generating an image identifier for an image, the processor 112 canpopulate the storage component 114 or the system storage component 140with the image and/or the image identifier. For example, thecommunication component 116 can receive the image from the imagingdevice 120. The processor 112 can then process the image to generate animage identifier and store the image identifier along with the image. Insome embodiments, the image identifier may be embedded as metadata inthe image file. In some embodiments, the image identifiers can be storedseparately from the images.

The processor 112 can operate to search the storage component 114 and/orthe system storage component 140 using an image query based on the imageidentifier generated. As the image identifier represents a portion ofeach of the image, the image identifier includes less data than thecomplete frame or whole image. Searching with the image identifier canbe faster than searching with the data associated with the completeframe or whole image.

When searching for an image and retrieving the image, the processor 112can generate an image query based on the image identifier and initiate asearch for the associated image in the storage component 114 or thesystem storage component 140. The image query generated by the processor112 can search the storage component 114 or the system storage component140 for similar image identifiers. The retrieved similar imageidentifiers can direct the processor 112 to the related images and/orreports associated with the related images stored in the storagecomponent 114 or in the system storage component 140. The processor 112can retrieve the related image and/or associated report with an imagequery search, for example.

The image(s) associated with the stored image identifiers identified bythe processor 112 as similar can be useful to the user requesting theimage query search by the image management system 110. In the medicalimaging context, a medical professional (radiologist, pathologist,diagnostician, researcher, etc.) may scan a patient and use the image tosearch for more information about the patient's illness.

For example, the processor 112 can receive an image query that defines asize, shape, and location of a tumor. In some embodiments, the imagequery can originate from the computing device 150. The processor 112 canthen initiate a search for images that satisfy that image query. Whenthe image management system 110 receives the search results, thecommunication component 116 can display the resulting images to the userfor review. In some embodiments, the resulting images can be displayedat the computing device 150. The image management system 110 can providefurther information in respect of the results for the user, such as themedical case information of each result. Accordingly, the user can seehow previous patients with a similar tumor were diagnosed, treated andevaluated.

The processor 112 can generate a report based on the imaging datareceived from the imaging device 120. For example, the reportingcomponent can identify similar reports from the storage component 114and extract relevant report data from the identified reports forgenerating the report for the imaging data received from the imagingdevice 120. An example report can include data related to variouscharacteristics including, but not limited to, procedure type, specimenfocality, tumor site, tumor focality, microscopic features of tumor,histologic type, histologic features, and histologic grade. In themedical context, reports can be obtained from another system, such as ahospital Laboratory Information System (LIS).

In some embodiments, the processor 112 can be separated into furthercomponents such as a pre-processing component, an indexing component,and a searching component which can be combined into a fewer number ofcomponents or may be separated into further components. Each componentmay also be implemented with hardware or software, or a combination ofboth. For example, one or more components can include computer programsexecutable by the processor 112 to conduct the relevant operations.

The communication component 116 may be any interface that enables theimage management system 110 to communicate with other devices andsystems. In some embodiments, the communication component 116 caninclude at least one of a serial port, a parallel port or a USB port.The communication component 116 may also include at least one of anInternet, Local Area Network (LAN), Ethernet, Firewire, modem, fiber, ordigital subscriber line connection. Various combinations of theseelements may be incorporated within the communication component 116.

For example, the communication component 116 may receive input fromvarious input devices, such as a mouse, a keyboard, a touch screen, athumbwheel, a track-pad, a track-ball, a card-reader, voice recognitionsoftware and the like depending on the requirements and implementationof the image management system 110.

The storage component 114 can include RAM, ROM, one or more hard drives,one or more flash drives or some other suitable data storage elementssuch as disk drives, etc. The storage component 114 is used to store anoperating system and programs, for example. For instance, the operatingsystem provides various basic operational processes for the processor.The programs include various user programs so that a user can interactwith the processor to perform various functions such as, but not limitedto, viewing and/or manipulating the image data as well as retrievingand/or transmitting image data as the case may be.

In some embodiments, the storage component 114 can store the images,information related to image identifiers of the images, informationrelated to the database, and information related to the imaging devices120.

The storage component 114 may include one or more databases (not shown)for storing image data, information relating to the image data, such as,for example, patient data with respect to the image data, informationrelated to reports associated with the images, such as, for example,diagnoses with respect to the image data. For example, the storagecomponent 114 can store image identifiers for the images. Each imageidentifier can also be associated with additional information, such asbut not limited to information on the tissue type and cancer type, andcan be accompanied by relevant pathology reports. When a searchconducted by the image management system 110 identifies an imageidentifier with associated reports, a later review of the initial queryimage by the pathologist can benefit from the associated reports.

Similar to the storage component 114, the system storage component 140can store images and information related to images. Images andinformation related to images can be stored in the system storagecomponent 140 for retrieval by the computing device 150 or the imagemanagement system 110.

Images described herein can include any digital image with any number ofpixels. The images can have any size and resolution. In someembodiments, the size and resolution of the image can be adjusted in oneor more pre-processing stages. Example image pre-processing includesdigital filtering for noise reduction.

An example image is a medical image of a body part, or part of a bodypart. A medical image can be generated using any modality, including butnot limited to microscopy, X-ray radiography, magnetic resonance imaging(MRI), ultrasound, and/or computed tomography scans (CT scans).Microscopy can include, but is not limited to whole slide imaging,reflected light, brightfield, transmitted light, fluorescence, andphotoluminescence.

The image can be a black and white, grey-level, RGB color, or falsecolor image. An image data structure typically includes an intensityvalue at each pixel location. To capture a wide dynamic range ofintensity values, the data structure of the image uses a number of databits to represent each pixel.

As noted above, sub-images (i.e., patches or tiles) can be definedwithin images. The dimensions of a sub-image are generally smaller thanthe dimensions of the image itself. For example, sub-image can bedefined as a small image for the purpose of dividing a larger image intoa smaller size. For example, for a larger image having dimensions thatare larger than 5000×5000 pixels, a sub-image can be defined as being1000 pixels by 1000 pixels. In some embodiments, a sub-image can overlapwith a neighboring sub-image—that is, a sub-image can include the samepixels as another sub-image of the same image. In some embodiments,sub-images of the same image may not overlap. For example, for an imageof a 10 mm×10 mm tissue area (captured at 0.5 μm pixel resolution or 20×magnification), 400 non-overlapping sub-images having a size of1000×1000 pixels can be defined.

In some embodiments, processing a plurality of sub-images can be fasterthan processing the image itself. In some embodiments, sub-images cancontain unique features of the larger image that can be distinguishedfrom other sub-images of the same larger image.

Images with high resolution are typically associated with large datafiles while images with lower resolution are associated with smallerdata files size. Images or sub-images stored with a lower resolution, inpart or whole, can be referred to herein as versions of the image orsub-image, respectively.

An image can belong to a dataset, that is, collection of related imagesthat are composed of separate elements that can be accessed andprocessed individually or in combination by a processor 112 for thepurpose of organizing them into groups or sets of similar images. Forexample, pathology brightfield whole slide images with hematoxylin andeosin staining can form a dataset of related images from differentorgans of the human body, Other example datasets can includefluorescence images of mouse brain tissue sections, or fluorescenceimages of immunohistochemical images for cancer diagnosis.

Information related to image identifiers of images that may be stored inthe storage component 114 or the system storage component 140 may, forexample, include but is not limited to the sub-images, features detectedin the sub-images, clusters (i.e., groups of sub-images), representativesub-images of the clusters, features detected in the representativesub-images, encoded representations of the representative sub-images,including encoded representations containing integer values and/orbinary values, such as barcodes. Barcodes can be, for example, aone-dimensional or a two-dimensional binary representation of uniqueimage features for the purpose of creating an index to represent animage. Binary representations of image features can be generated by athresholding algorithm of image feature vectors to map real-valuednumbers to zeros and ones. Barcodes are generally used for computationalpurposes and a visual representation, such as a traditional barcodehaving a plurality of parallel lines of varying widths, can also begenerated if necessary. Generally, an image can be represented by afinite number of barcodes.

Information related to image annotations that may be stored in thestorage component 114 or the system storage component 140 may, forexample, include but is not limited to text comments, audio recordings,markers, shapes, lines, free form mark-ups, and measurements.

Information related to imaging devices that may be stored in the storagecomponent 114 or the system storage component 140 may, for example,include but is not limited to a device identifier, a device location, adevice operator, a modality, supported image resolutions, supportedimage file types, image size range, image margin ranges, and an imagescale range.

Information related to image subjects that may be stored in the storagecomponent 114 or the system storage component 140 may, for example,include but is not limited to a patient identifier, a date of birth,gender, home address, primary physician, and medical team in the case ofmedical images.

Information related to the image database that may be stored in thestorage component 114 or the system storage component 140 may, forexample, include but is not limited to a similarity indicator and arelevancy indicator.

In some embodiments, the image management system 110 can receive imagesdirectly from the imaging device 120. For example, the image managementsystem 110 can read images directly from a storage component of theimaging device 120. The image management system 110 may process queryimages, generate image identifiers, and retrieve similar images inreal-time or nearly in real-time, as the query images are being receivedfrom the imaging device 120. By increasing the speed in which the queryimage can be reviewed and analyzed with respect to an archive of imagesin real-time, or near real-time, the image management system 110 canimprove patient care and responsiveness.

In the context of the present disclosure, the terms “real-time” or “nearreal-time” is defined as image processing that is concurrent to, orwithin a small temporal window of, the query image acquisition orgeneration. The purpose of real-time or near real-time image processingis to deliver search and retrieval results from the image managementsystem 110 to the user within seconds or minutes after a medical imagingscan of the patient. Accordingly, related medical case information maybe delivered to the patient's doctor with minimal delay, for a timelydiagnosis of the patient's illness.

In some embodiments, images can be loaded into the image managementsystem 110 from the system storage component 140 or computing device 150that is remote from the image management system 110. For example, theimage management system 110 may be used to process offsite data.Processing offsite data or non-time-sensitive data can assist withvarious applications, such as research applications where real-timeprocessing is not necessary, and/or medical diagnostic applications atareas (e.g., remote areas, underprivileged areas, underdeveloped areas,etc.) where real-time processing is not possible, or nearly impossibledue to unreliable or slow communication networks. For researchapplications, a researcher tasked with processing hundreds or thousandsof medical images would still benefit from the increased processingspeed of the image management system 110 over conventional feature-baseddetection CBIR systems, even if the hundreds or thousands of medicalimages are not related to any patients awaiting diagnosis. In areas withunreliable and/or slow communication networks (e.g., remote areas,underprivileged areas, underdeveloped areas, etc.), the methods andsystems described herein can facilitate retrieval of the related imageseven with the unreliable and/or slow communication networks.

The computing device 150 may be any networked device operable to connectto the network 130. A networked device is a device capable ofcommunicating with other devices through a network such as the network130. A network device may couple to the network 130 through a wired orwireless connection.

The computing device 150 may include at least a processor and memory,and may be an electronic tablet device, a personal computer,workstation, server, portable computer, mobile device, personal digitalassistant, laptop, smart phone, WAP phone, an interactive television,video display terminals, gaming consoles, and portable electronicdevices or any combination of these.

In some embodiments, the computing device 150 may be a laptop, or asmartphone device equipped with a network adapter for connecting to theInternet. In some embodiments, the connection request initiated from thecomputing device 150 may be initiated from a web browser and directed atthe browser-based communications application on the image managementsystem 110.

The network 130 may be any network capable of carrying data, includingthe Internet, Ethernet, plain old telephone service (POTS) line, publicswitch telephone network (PSTN), integrated services digital network(ISDN), digital subscriber line (DSL), coaxial cable, fiber optics,satellite, mobile, wireless (e.g. Wi-Fi, WiMAX), SS7 signaling network,fixed line, local area network, wide area network, and others, includingany combination of these, capable of interfacing with, and enablingcommunication between, the image management system 110, the imagingdevice 120, the system storage component 140, and the computing device150.

Referring now to FIG. 2 , shown therein is a schematic 200 illustratingan example of generating image identifiers for a plurality of images.Image identifiers can be used to locate images with similar image datawithin a database. The schematic 200 shows the generation of imageidentifiers 212 for a plurality of images 202. In other embodiments, animage identifier can be generated for a single image, such as a newlyacquired image.

The plurality of images 202 can be stored in a database as an unindexedarchive of images. As shown in FIG. 2 , the plurality of images 202 canbe stored in a storage component, such as system storage component 140.While the plurality of images 202 are shown as being stored in a singlestorage component for illustrative purposes, the plurality of images 202can be stored in a plurality of storage components distributed over anetwork. The image management system 110 can access the plurality ofimages 202 in the system storage component 140.

The image management system 110 can use a processor, such as processor112 (not shown in the schematic 200), to generate a plurality of imageidentifiers 212 for the plurality of images 202. One or more imageidentifiers can be generated for each image. Any appropriate techniquescan be used for generating the image identifiers, including but notlimited to segmentation, clustering, deep networks, and binarizationalgorithms. The image identifiers 212 can be stored in a storagecomponent, such as storage component 210 dedicated to storing imageidentifiers. While FIG. 2 shows the storage component 210 as being adifferent storage component than the storage component in which theimages are stored, in some embodiments, the image identifiers can bestored in the same storage component as the images. That is, in someembodiments, the image identifiers 212 can be stored in a storagecomponent that is not dedicated to storing image identifiers, such assystem storage component 140. While the plurality of image identifiers212 are shown as being stored in a single storage component forillustrative purposes, the plurality of image identifiers 212 can bestored in a plurality of storage components distributed over a network.

The processor 112 can generate image identifiers for each image of theplurality of images sequentially, or in parallel. When the processor 112generates image identifiers for two or more images in parallel, theprocessor 112 can receive the two or images simultaneously and generateimage identifiers for each of the images simultaneously. When theprocessor 112 generates image identifiers for two or more imagessequentially, the processor 112 can receive a first image and generateone or more image identifiers for the first image. Only after generatingthe one or more image identifiers for the first image, the processor 112can receive a second image and generate one or more image identifiersfor the second image.

It should be noted that an image can be characterized using multiplesample groups, where each sample group consists of multiplemagnifications centered on a region of interest. That is, the exampleindexing shown in FIG. 2 can be implemented for each magnification of animage. The plurality of images 202 can be multiple versions of an image.While indexing each magnification of an image can provide a morecomplete representation of the image, such indexing can increase thestorage requirement of indexing and reduce the computational efficiencyof search and retrieval.

Referring now to FIG. 3 , shown therein is a schematic 300 illustratingan example search within a database to locate images with similar imagedata as a query image. The example schematic 300 shows the location of aplurality of images 330 with similar image data for a query image 302using image identifiers 312.

The query image 302 can be a single query image. The database can be anindexed archive of images, such as the plurality of images 320. As shownin FIG. 3 , the plurality of images 320 can be stored in a storagecomponent, such as system storage component 140. While the plurality ofimages 320 are shown as being stored in a single storage component forillustrative purposes, the plurality of images 320 can be stored in aplurality of storage components distributed over a network.

An image identifier for the query image 302 and the plurality of images320 can be stored in a storage component, such as storage component 310.Storage component 310 can be a storage component dedicated to storingimage identifiers, such as storage component 310, or a storage componentthat also stores the plurality of images 320, such as system storagecomponent 140. In other embodiments, the image identifier for the queryimage 302 is not stored and instead, the image management system 110 cangenerate an image identifier for the query image 302.

The image management system 110 can receive the query image 302 and theimage identifier 312 for the query image and access the plurality ofimages 320 in the system storage component 140. The image managementsystem 110 can use a processor, such as processor 112 (not shown inschematic 300), to locate a plurality of images 330 for the query image302 based on the image identifier 312 and the image identifiers for theplurality of images 320. While FIG. 3 shows the plurality of images 330being four images for illustrative purposes, fewer or more images can belocated by the search.

In some embodiments, the processor 112 can sort the plurality of images330. In some embodiments, the processor 112 can sort the plurality ofimages 320 in order of similarity. For example, the processor 112 cansort the plurality of images 320 in order of decreasing similarity tothe query image 302.

In some embodiments, the processor 112 can identify one or more portionsof image data of the query image 302 that is analogous to image data ofan image of the plurality of images 320 having the greatest similarityto the query image. In some embodiments, the processor 112 can use theimage identifiers 312 to identify one or more portions of image data ofthe query image 302 that is analogous to image data of an image of theplurality of images 320. For example, the processor 112 can determinethat portions of image data of the query image 302 are similar toportions of image data of an image of the plurality of images 320 basedon a measure of similarity between the image identifier for the queryimage 302 and the image identifier in storage component 310 for theimage of the plurality of images 320.

It should be noted that the example search shown in FIG. 3 can beimplemented with sub-images. That is, query image 302 can be a sub-imageof a query image 302 and the plurality of images 320 can be sub-imagesof one or more images of the plurality of images 320.

It should be noted that the example search shown in FIG. 3 can beimplemented with multiple versions of an image. That is, query image 302can be a version of an image having a particular magnification and theplurality of images 320 include multiple versions of that image. Suchindexing can reduce the computational efficiency of search andretrieval.

Referring now to FIG. 4 , an example method 400 of generating encodedrepresentations for multiple magnifications of one or more query imagesis shown in a flowchart diagram. To assist with the description of themethod 400, reference will be made simultaneously to FIG. 5A to FIG. 13. An image management system, such as image management system 110 havinga processor 112 can be configured to implement method 400. Method 400can be reiterated for each query image of the one or more query images.

Method 400 can begin at 402, when the processor 112 obtains a queryimage, such as example query image 502 shown in illustration 500 of FIG.5A. Although query image 502 is shown in FIG. 5A as being a medicalimage, and in particular, a histopathology image, the query image 502can be any image. For example, the query image can be a satellite image.

Furthermore, although only one query image 502 is shown in FIG. 5A, theprocessor 112 can obtain one or more query images. The one or more queryimages can be obtained from an imaging device 120, a computing device150, or a system storage component 140. The term “query image” usedherein refers to an image for the purpose of using as an input to anoperation performed by a processor, such as processor 112.

In some embodiments, the processor 112 can pre-process the query image.In some embodiments, the processor 112 can receive a pre-processed queryimage. For example, as shown in FIG. 5A, the query image 502 can includea background 504 and a foreground 506. In some embodiments, theprocessor 112 can segment the foreground of the query image, such asforeground 506 of query image 502, from a background of the query image,such as background 504. To segment the foreground 506 of the queryimage, the processor 112 can identify each pixel of the query image 502as either a foreground pixel or a background pixel, based on theintensity value of that pixel location. When the query image is amedical image, the foreground 506 of image 502 can represent a specimen,such as a tissue sample.

In some embodiments, the processor 112 can define sub-images within thequery image. The processor 112 can operate clustering techniques toselect a mosaic of sub-images—that is, a plurality of sub-images—aspreliminary sub-images to represent the query image. For example, theplurality of preliminary sub-images 508 can represent query image 502 ofFIG. 5A. The plurality of preliminary sub-images 508 can includepreliminary sub-images 508 a, 508 b, 508 c, 508 d, and 508 e. While fivepreliminary sub-images are shown in FIG. 5A for illustrative purposes,fewer or more preliminary sub-images can be generated. Furthermore,while square-shaped preliminary sub-images are shown in FIG. 5A forillustrative purposes, other shapes are possible, including but notlimited to circular, triangular, oval, and rectangular shapedpreliminary sub-images.

At 404, the processor 112 can identify a set of anchors within the queryimage. An anchor can relate to coordinates within the query image or apoint within the image. In some embodiments, the processor 112 canidentify the set of anchor points from the foreground 506 of the queryimage 502.

In some embodiments where a plurality of preliminary sub-images 508 forrepresenting the query image has been generated, the centers of eachpreliminary sub-image of the plurality of preliminary sub-images 508 canbe identified as an anchor point. For example, as shown in theillustration 520 in FIG. 5B, the processor 112 can identify anchorpoints 510 a, 510 b, 510 c, 510 d, and 510 e corresponding topreliminary sub-images 508 a, 508 b, 508 c, 508 d, and 508 erespectively. While five anchor points 510 a, 510 b, 510 c, 510 d, and510 e are shown in FIG. 5B for illustrative purposes, fewer or moreanchor points can be identified.

At 406, the processor 112 can use the set of anchor points identified at404 to generate a plurality of sub-images for a plurality ofmagnification levels. In particular, the coordinates of an anchor pointcan be used as a reference point to generate each sub-image of theplurality of sub-images for that anchor point. That is, each sub-imagecan be generated to have the same relationship to the anchor point. Forexample, in some embodiments, an anchor point can be used as the centerpoint of each sub-image of the plurality of sub-images. As a result ofusing the anchor point as the center point of each sub-image, thesub-images generated will be concentric.

FIG. 6 shows an example illustration 600 of a plurality of initialsub-images 612, 614, and 616 generated for an anchor point 610 of image602. As can be seen in FIG. 6 , the anchor point 610 corresponds to thecenter point of each initial sub-image 612, 614, and 616. In thisexample, each pixel of image 602 is equal in size. That is, each pixelof image 602 corresponds to an area of the image that is equal in size.As well, initial sub-images 612, 614, and 616 have different dimensions(e.g., sizes characterized by pixels) and correspond to different sizeportions of the query image 602.

While each of initial sub-images 612, 614, and 616 are shown in FIG. 6as corresponding to the foreground 606 of the query image 602 forillustrative purposes, in some embodiments, one or more of the initialsub-images 612, 614, and 616 can include portions of the background 604.

As noted above, initial sub-image 612 can be centered about anchor point610. Initial sub-image 612 can correspond to a portion of the queryimage 602 having dimensions of n×n pixels (i.e., n pixels is the lengthof each side). Furthermore, initial sub-image 612 can correspond to aportion of the query image 602 that has an area of n².

Initial sub-image 614 can correspond to a portion of the query image 602having dimensions of 2n×2n pixels (i.e., 2n pixels is the length of eachside). That is, initial sub-image 614 can have larger dimensionscharacterized by pixels than initial sub-image 612. Furthermore, initialsub-image 614 can correspond to a portion of the query image 602 thathas an area of 4n². That is, initial sub-image 614 can cover an areathat is four times the area covered by initial sub-image 612. As can beseen in FIG. 6 , both of initial sub-images 612 and 614 can be centeredabout anchor point 610. As a result, initial sub-image 614 can includethe portion of the query image 602 that is included in the initialsub-image 612. That is, initial sub-image 614 can overlap the entiretyof initial sub-image 612.

Initial sub-image 616 can correspond to a portion of the query image 602that has a size of 4n×4n pixels (i.e., 4n pixels is the length of eachside) and a portion of the query image 602 that has an area of 16n².That is, initial sub-image 616 corresponds to a portion of the queryimage that is larger than initial sub-image 614. Initial sub-image 616can cover an area that is 16 times the area covered by initial sub-image612 and 4 times the area covered by sub-image 614. As can be seen inFIG. 6 , both of initial sub-images 614 and 616 can be centered aboutanchor point 610. As a result, initial sub-image 616 can include theportion of the query image 602 that is included in initial sub-image614. That is, initial sub-image 616 can overlap the entirety of initialsub-image 614.

While three initial sub-images are shown in FIG. 6 for illustrativepurposes, fewer or more sub-images can be generated. For example, in thecase of FIG. 6 where the sub-image is square-shaped, a plurality ofsub-images having dimensions characterized by m (n×n) pixels and an areaof m²n² can be generated, where m is a finite positive integer.

In some embodiments, the number of sub-images that can be generated canbe limited by the location of the anchor point relative to the physicalboundaries of the image. For example, a query image may be acquired at40× magnification with a pixel resolution of 0.2 μm. A first initialsub-image of the query image can be generated with dimensions of1000×1000 pixels. The first initial sub-image of the query imagecorresponds to a portion of the query image representing 200×200 μm andan area of 40,000 μm². A second initial sub-image of the query image canbe generated with dimensions of 2000×2000 pixels, corresponding to aportion of the query image representing 400×400 μm and an area of160,000 μm². A third initial sub-image of the query image can begenerated with dimensions of 4000×4000 pixels, corresponding to aportion of the query image representing 800×800 μm and an area of640,000 μm².

In other embodiments, an anchor point can be used as a vertex of eachsub-image of the plurality of sub-images. In some cases, it can beadvantageous to use an anchor point as a vertex as opposed to a centerpoint. For example, for pathology images with a tissue sample as theforeground 606 of the image 602, anchor points near the edge of thetissue sample can be used as vertices of sub-images to reduce the amountof background 604 in the plurality of sub-images and anchor points nearthe center of the tissue sample can be used as center points of theplurality of sub-images.

For example, as shown in the illustration 700 in FIG. 7 , the processor112 can generate a plurality of initial sub-images 712, 714, and 716 inwhich the anchor point 710 corresponds to a vertex of each initialsub-image 712, 714, and 716. Furthermore, while anchor point 710 isshown as being the upper left corner of the plurality of initialsub-images 712, 714, and 716 for illustrative purposes, the anchor point710 can be any vertex of the plurality of initial sub-images, such asthe lower left corner, upper right corner, or lower right corner.

Referring now to FIG. 8A, 8B, and 8C, shown therein are exampleillustrations for generating sub-images for a plurality ofmagnifications levels. Initial sub-images 802, 804, and 806 can begenerated from an image having a high magnification, such asmagnification M, which can be but is not limited to greater than 20× or40×.

As shown in the illustration 800 of FIG. 8A, each of the initialsub-images 802, 804, and 806 can be obtained from the same magnificationlevel and so each pixel 808, 818, 828 of the initial sub-images 802,804, and 806 can be equal in size (e.g., size n).

In this example, sub-images 822, 824, and 826 are versions of initialsub-images 802, 804, and 806 respectively. That is, versions 822, 824,and 826 correspond to initial sub-images 802, 804, and 806 respectivelyat equal or lower magnification levels. Each of versions 822, 824, and826 have the same number of pixels. To obtain versions 822, 824, and826, operations 812, 814, and 816 can be applied to the initialsub-images 802, 804, and 806, respectively. The operations 812, 814, and816 can convert or transform the size of the pixels in each of theinitial sub-images 802, 804, 806 to a different size. The operations812, 814, 816 can be a conversion or transformation of any sub-image ata first magnification level to another sub-image at a secondmagnification level that is equal to or lower than the firstmagnification level.

For example, the initial sub-image 802 can be used to generate version822. In the example of FIG. 8A, the initial sub-image 802 can havedimensions characterized by n×n pixels. Likewise, version 822 can havedimensions characterized by n×n pixels. While version 822 is shown ashaving the same pixel size as the initial sub-image 802 in FIG. 8A forillustrative purposes, version 822 can have a different pixel size thanthe initial sub-image 802.

FIG. 8B shows an illustration of the application of example operation812 to initial sub-image 802 to obtain version 822. The intensity valueof each pixel of initial sub-image 802 and version 822 is shown. As canbe seen, the pixels of version 822 correspond to the initial sub-image802. That is, since version 822 has the same pixel size as the initialsub-image 802, the intensity values of the pixels of version 822 areequal to the intensity values of the pixels of the initial sub-image802. Furthermore, each representative pixel has the same relativelocation within version 822 as the corresponding plurality of pixels haswithin the initial sub-image 802.

Referring back to FIG. 8A, the initial sub-image 804 can be used togenerate version 824. The initial sub-image 804 can have dimensionscharacterized by 2n×2n pixels. To generate version 824 having dimensionscharacterized by n×n pixels, similar to version 822, an operation 814can be applied to the initial sub-image 804. The operation 814 cangenerate a version 824 having representative pixels 820. Each pixel 820of version 824 can correspond to four pixels 818 of the initialsub-image 804. That is, the operation 814 can be a 4:1 conversion ortransformation. The portion of the query image that version 824corresponds to remains the same as the portion of the query image thatinitial sub-image 804 corresponds to.

In the case that initial sub-image 804 has similar dimensions and pixelresolution of 0.2 μm as that of initial sub-image 614—that is, thesecond initial sub-image 804 corresponds to a portion of the query imagerepresenting 400×400 μm and an area of 160,000 μm²— a 4:1 transformationof pixels 818 of initial sub-image 804 can result in representativepixels 820 of version 824 having a pixel resolution of 0.4 μm. As shown,version 824 has a different pixel size than initial sub-image 804.Furthermore, version 824 has dimensions characterized by n×n pixels,similar to version 822. However, the portion of the query image thatversion 824 corresponds to remains the same. That is, version 824corresponds to the portion of the query image representing 400×400 μmand an area of 160,000 μm².

In some embodiments, representative pixels 820 of version 824 can be asubsampling or downsampling of pixels 818 of the initial sub-image 804.The terms subsampling and downsampling (also referred to as sampling) asused herein can refer to representing a plurality of pixels with fewerpixels. In some embodiments, the intensity value of the representativepixels of the version of the initial sub-image are based on theintensity values of the plurality of pixels of the initial sub-image.

In at least one embodiment, a plurality of pixels of the initialsub-image can be represented by a representative pixel of the version ofthe initial sub-image. The intensity value of a representative pixel ofthe version can be an average, such as the mean of the intensity valuesof the plurality of pixels of the initial sub-image. In someembodiments, the intensity value of a representative pixel of theversion can be the median or the mode of the intensity values of theplurality of pixels of the initial sub-image.

FIG. 8C shows an illustration of the application of example operation814 to initial sub-image 804 to obtain version 824. The intensity valueof each pixel of initial sub-image 804 and version 824 is shown. Eachplurality of pixels 832, 836 of the initial sub-image 804 can berepresented by a respective representative pixel 834, 838 in version824. Furthermore, each representative pixel 834, 838 has the samerelative location within version 824 as the corresponding plurality ofpixels 832, 836 has within the initial sub-image 824, respectively.

For illustrative purposes, the intensity values of each of therepresentative pixels 834, 838 in version 824 is shown in FIG. 8C asbeing the mean of the intensity values of the respective plurality ofpixels 832, 836 of the initial sub-image 804. While FIG. 8C shows thepixels in the initial sub-image 804 being subsampled equally along boththe x-dimension and y-dimension of the initial sub-image (i.e., 2×2pixels), other methods for sampling are possible. For example, thepixels 818 in the initial sub-image 804 may be sampled in only thex-dimension of the initial sub-image (i.e., 4×1 pixels) or in only they-dimension of the initial sub-image (i.e., 1×4 pixels).

Furthermore, while FIG. 8C shows a sampling of four pixels in theinitial sub-image 804 for illustrative purposes, fewer or more pixelscan be subsampled. For example, referring back to FIG. 8A, the initialsub-image 806 can be used to generate version 826. Initial sub-image 806can have dimensions characterized by 4n×4n pixels. To generate version826 having dimensions characterized by n×n pixels, similar to version822, an operation 816 can be applied to the initial sub-image 806. Theoperation 816 can generate a version 826 having representative pixels830. Each pixel 830 of version 826 can correspond to 16 pixels 828 ofthe initial sub-image 806. That is, the operation 816 can be a 16:1conversion. The portion of the query image that version 826 correspondsto remains the same as the portion of the query image that initialsub-image 806 corresponds to.

In the case that initial sub-image 806 has similar dimensions and pixelresolution of 0.2 μm as that of initial sub-image 616—that is the thirdsub-image 806 corresponds to a portion of the query image representing800×800 μm and an area of 640,000 μm²— a 16:1 transformation of pixels828 of initial sub-image 806 can result in representative pixel 830 ofversion 826 having a pixel resolution of 0.8 μm. As shown, version 826has a different pixel size than initial sub-image 806. Furthermore,version 826 has dimensions characterized by n×n pixels, similar toversion 822 and 824. However, the portion of the query image thatversion 826 corresponds to remains the same. That is, version 826corresponds to the portion of the query image representing 800×800 μmand an area of 640,000 μm².

In other embodiments, more than one representative pixel can be used torepresent a plurality of pixels of the initial sub-image. Someembodiments can involve a different magnification conversion. Forexample, for a 5:1 conversion, a plurality of pixels having dimensionsof 5×3 pixels in an initial sub-image can be subsampled along both thex-dimensions and y-dimensions and be represented by 3×1 pixels in aversion of the initial sub-image. That is, 15 pixels of the initialsub-image can be represented by three representative pixels of theversion of the initial sub-image. The three representative pixels of theversion of the initial sub-image can have intensity values correspondingto a highest intensity value, a lowest intensity value, and averageintensity value. The location of each of the three representative pixelsin the version of the initial sub-image to one another can depend on thelocation of the pixel having the highest intensity value in the initialsub-image relative to the location of the lowest intensity value in theplurality of pixels that they represent in the initial sub-image.

Referring now to FIGS. 9A and 9B, shown therein is another exampleillustration for generating sub-images for a plurality of magnificationlevels. Similar to image 502 and 702, image 904 can be obtained at 402.The image 904 can include a background 908 and a foreground 912 havingtwo regions of interest 912 a and 912 b. The image 902 can have a highmagnification, such as but not limited to 20× or 40×.

Anchor points 928, 932, and 936 can be identified at 404. The anchorpoints 928, 932, and 936 can be identified to as center points at whichto generate a plurality of sub-images at multiple magnifications.

For each anchor point 928, 932, and 936, the processor 112 can generatea plurality of sub-images. For example, for anchor point 928, aplurality of concentric initial sub-images 916 a, 916 b, 916 c centeredabout anchor point 928 can be generated. Similarly, a plurality ofconcentric initial sub-images 920 a, 920 b, and 920 c centered aboutanchor point 932 and a plurality concentric initial sub-images 924 a,924 b, and 924 c centered about anchor point 936 can be generated.

As illustrated in FIG. 9A, initial sub-images 916 a, 920 a, 924 a canhave the same dimensions and area size at the magnification of the image904. Similarly, initial sub-images 916 b, 920 b, 924 b can have the samedimensions and area size at the magnification of the image 904 andinitial sub-images 916 c, 920 c, 924 c can have the same dimensions andarea size at the magnification of the image 904. For example, initialsub-images 916 a, 920 a, 924 a can each have dimensions characterized byn×n pixels and an area size of A at the magnification of the image 904;initial sub-images 916 b, 920 b, 924 b can each have dimensions of 2n×2npixels and an area size of 4 A at the magnification of the image 904;and initial sub-images 916 c, 920 c, 924 c can each have dimensionscharacterized by 4n×4n pixels and an area size of 16 A at themagnification of the image 904.

The method of determining the size of initial sub-images for an anchorpoint can be generalized. For example, an initial square-shapedsub-image with dimensions characterized by n×n pixels and an area of Aat magnification M can be generated. Additional initial sub-images canbe generated by increasing the size of the sub-images by a factor of k,where k is a finite positive integer. Thus, the additional initialsub-images can have dimensions of k(n×n) pixels and an area of Ake(denoted as area A′).

Each of initial sub-images 916 a, 916 b, 916 c, 920 a, 920 b, 920 c, 924a, 924 b, and 924 c of image 904 in FIG. 9A can be used to generaterespective versions 916 a, 944 b, 944 c, 920 a, 948 b, 948 c, 924 a, 952b, and 952 c in version 940 as shown in FIG. 9B. For example, theoperation described with respect to FIG. 8A to 8C can be applied toinitial sub-images of FIG. 9A to generate versions shown in FIG. 9B at406. As can be seen in FIG. 9B, each version of an initial sub-imagecorresponds to the same area size as the initial sub-images 916 a, 916b, 916 c, 920 a, 920 b, 920 c, 924 a, 924 b, and 924 c. However, toobtain the same number of pixels in each sub-image, the magnification ofeach sub-image remains the same or is decreased based on the operationapplied.

As can be seen in FIG. 9B, version 940 includes a background 908 and aforeground 912 having two regions of interest 912 a and 912 b, similarto image 904. After the operation, each sub-image of version 940 has anequal number of pixels, despite corresponding to different area sizes ofthe image. For example, each sub-image of the plurality of sub-images916 a, 944 b, and 944 c (collectively referred to as plurality ofsub-images 944) have the same number of pixels, namely n×n pixels.Likewise, each sub-image of the plurality of sub-images 920 a, 948 b,and 948 c (collectively referred to as a plurality of sub-images 948)and the plurality of sub-images 924 a, 952 b, and 952 c (collectivelyreferred to as a plurality of sub-images 952) also have n×n pixels.

Each plurality of sub-images 944, 948, and 952 can include a sub-imageat each of the different magnifications: M (i.e., the originalmagnification), M/2, and M/4. That is, sub-images 916 a, 920 a, and 924a have a magnification of M; sub-images 944 b, 948 b, and 952 b have amagnification of M/2; and sub-images 944 c, 948 c, and 952 c have amagnification of M/4.

Likewise, each plurality of sub-images 944, 948, and 952 include asub-image at each of the different area sizes: A (i.e., the initialsub-image area size), 4A, and 16A. That is, sub-images 916 a, 920 a, and924 a have an area A; sub-images 944 b, 948 b, and 952 b have an area4A; and sub-images 944 c, 948 c, and 952 c have an area 16A.

The operation to generate representative pixels from pixels of theinitial sub-images, such as but not limited to operations 812, 814, and816, can allow for flexibility in generating sub-images at differentmagnifications. This can be advantageous in medical imaging andparticularly in pathology where the analysis of image at differentmagnifications can be important for making diagnoses.

For example, digital pathology images are typically acquired at 40×magnification but on occasion pathologists can require 20×, 10× and even5× magnifications in combination with 40×, to diagnose the disease,including the level of the disease. Furthermore, as imaging technologiesevolve new, higher resolution imaging devices may acquire images atmagnifications of 75×, 85×, or 100×. For images captured at such highmagnification, lower magnification sub-images having magnificationlevels of, for example, 40× and 20×can be generated. That is, while itis possible to generate additional versions of the image having amagnification of M/2 or M/4, the additional versions of the image arenot limited to such fractions of the initial magnification.

Generally, there are no limitations to the number of sub-images selectedto represent an image. However, the number of sub-images selected torepresent an image can depend on the size of the image. While it isgenerally desirable to generate sub-images with minimal portions ofbackground 908, in some cases, sub-images, particularly those at lowermagnifications, can include small regions of background. For example inFIG. 9A, sub-images 916 b and 916 c can include portions of thebackground 908 of image 904.

In addition, the number of sub-images can be increased to cover theentire region of interest, particularly at lower magnifications. Basedon the shape of the region of interest, some of the sub-images canoverlap with each other. For example, as shown in FIG. 9A, initialsub-images 920 c and 924 c can overlap. The amount of overlap can dependon the type of image under investigation. The ability to use overlappingsub-images can be advantageous for pathology images (WSIs) where eachregion of interest within an image can be important for diagnosis.

Referring back to FIG. 4 now, at 408, for each magnification level, theprocessor 112 can apply an artificial neural network (ANN) to sub-imagescorresponding to that magnification level to extract a feature vectorrepresentation of image characteristics of the query image at thatmagnification level.

FIG. 10 shows a first example block diagram 1000 of an ANN that can beused to extract a feature vector representation of image characteristicsof a query image at 408. Query image 1004 can be, for example, queryimage 502, 702, or 904. While query image 1004 is shown in FIG. 10 asbeing a medical image for illustrative purposes, and in particular, apathology image, the query image 1004 can be any type of image.

At 1008, the processor 112 can apply operations to the query image 1004to generate sub-images having different magnifications 1012 a, 1012 b,and 1012 c (collectively referred to as 1012). For example, operations1008 can include the sampling operations described in respect of FIG. 8Ato 8C. That is, versions 1012 can each have the same number of pixels(i.e., n×n pixels) but correspond to different magnifications and areasizes. Version 1012 a corresponds to a first magnification, such as M,and has an area of A′. Version 1012 b corresponds to a secondmagnification, such as M′ (which can be lower than M) and has an area ofB′ (which can be larger than A′). Version 1012 c corresponds to a thirdmagnification, such as M″ (which can be lower than each of M and M′) andhas an area of C′ (which can be larger than each of A′ and B′). Whileonly three versions 1012 a, 1012 b, and 1012 c are shown in FIG. 10 forillustrative purposes, fewer or more versions can be generated.

The plurality of sub-images at different magnifications 1012 can beinput to an ANN. The ANN can be a deep ANN, such as deep ANN 1016. DeepANN 1016 can be trained to extract a multi-magnification feature vector1028 or classes 1040. The ANN 1016 can include a plurality ofconvolution and pooling blocks 1020 a, 1020 b, and 1020 c (collectivelyreferred to as 1020).

While only three convolution and pooling blocks 1020 a, 1020 b, and 1020c are shown in FIG. 10 for illustrative purposes, the ANN 1016 caninclude fewer or more convolution and pooling blocks 1020. Convolutionand pooling operations of different groups of sub-images (i.e.,different magnifications) can take place sequentially or in parallel. Insome embodiments, there can be fewer convolution and pooling blocks 1020than the number of different magnifications. In such cases, theconvolution and pooling operations for different magnifications can takeplace sequentially. In some embodiments, the number of convolution andpooling blocks 1020 can correspond to the number of differentmagnifications of the plurality of sub-images. That is, the plurality ofsub-images can be grouped by magnification levels. Each group ofsub-images having the same magnification level can be input to aconvolution and pooling block of the deep ANN 1016. In the example ofFIG. 10 , convolution and pooling operations 1020 for differentmagnifications are shown as being parallel operations at 1020 a, 1020 band 1020 c to increase speed of the computational process.

Autoencoders 1024 a, 1024 b, and 1024 c (collectively referred to as1024) can compress the extracted feature vectors of the last poolinglayer of 1020 a, 1020 b and 1020 c respectively. Each of theautoencoders 1024 a, 1024 b, and 1024 c can include a respective decoder1022 a, 1022 b, and 1022 c (collectively referred to as decoders 1022)that can be used during training of the ANN 1016. Autoencodingoperations of different groups of sub-images (i.e., differentmagnifications) can take place sequentially or in parallel. In theexample of FIG. 10 , autoencoding operations 1024 for differentmagnifications are shown as being parallel operations 1024 a, 1024 b,and 1024 c to increase speed of the computational process. In someembodiments, principal component analysis (PCA) can be used to compressthe extracted feature vectors of the last pooling layer of 1020 a, 1020b and 1020 c instead of autoencoders.

While both the convolution and pooling operations 1020 and theautoencoding operations 1024 are shown in FIG. 10 as being paralleloperations, in some embodiments, one or both of the convolution andpooling operations 1020 and the autoencoding operations 1024 can besequential operations.

Referring back to FIG. 4 now, at 410, an encoded representation formultiple magnifications of the query image can be generated based on thefeature vectors extracted for the plurality of magnification levels.

For example, in the example of FIG. 10 , the feature vectors obtainedfrom the deepest (e.g., smallest) layer of the autoencoders 1024 can beconcatenated together to provide a single feature vector 1028. That is,the single feature vector 1028 can include compressed (autoencoded)features of all magnifications 1024 a, 1024 b, and 1024 c.

Feature vector 1028 can also be used in two fully connected layers 1032,1036 to classify the sub-images 1012 into one of n classes: C1, C2, C3 .. . , Cn at 1040. Classification can involve categorizing featurevectors into classes to represent the image. Classes can representpredictions (e.g., a probabilities) that an image characteristic ispresent in the image. Neural networks can be used for classification.While two fully connected layers are shown in FIG. 10 for illustrativepurposes, one or more fully connected layers can be used.

The feature extraction and classification is repeated for all sub-imagesof the plurality of sub-images generated for the image 1004. Either theconcatenated feature vector 1028 or the first fully connected layer 1040can be used as an encoded representation, or image identifier for thequery image 1004.

Referring now to FIG. 11 , shown therein is another example blockdiagram 1100 of an ANN that can be used to extract a feature vectorrepresentation of image characteristics of a query image at 408. Queryimage 1104 can be, for example, query image 502, 702, or 904. Whilequery image 1104 is shown in FIG. 11 as being a medical image forillustrative purposes, and in particular, a pathology image, the queryimage 1104 can be any type of image.

The query image 1104 can be used to generate versions 1106 and 1108 ofthe query image having lower magnifications. Operations can be appliedto the query image 1104 to generate versions 1106 and 1108. For example,operations similar to the sampling operations described in respect ofFIG. 8A to 8C can be applied to the query image 1104. That is, versions1106 and 1108 of the query image 1104 can each have the same area sizebut correspond to different magnifications and number of pixels.

Query image 1104 corresponds to a first magnification, such as M, andhas an area of A. Version 1106 has the same area size as the query image1104 and corresponds to a second magnification, such as M′ (which can belower than M). Version 1108 has the same area size as the query image1104 and version 1106 and corresponds to a third magnification, such asM″ (which can be lower than each of M and M′). While only two versions1106 and 1108 of the query image are shown in FIG. 11 for illustrativepurposes, fewer or more versions of the query image can be generated.

A plurality of sub-images 1110, 1112, and 1114 can be generated for eachof the images 1104, 1106 (i.e., version 1106 of image 1104), and 1108(i.e., version 1108 of image 1104) independently at 406. That is,preliminary sub-images for each of images 1104, 1106, and 1108 can beindependently selected. As described above, selecting preliminarysub-images can involve segmenting the image into sub-images, clusteringthe sub-images based on similarity, and selecting a mosaic of sub-imagesas preliminary sub-images to represent the image. A set of anchor pointsfor each image 1104, 1106, and 1108 can be identified from thepreliminary sub-images of each image 1104, 1106, and 1108 independentlyat 404. Each sub-image of the plurality of sub-images 1110, 1112, and1114 can have n×n pixels.

The sub-images from plurality of sub-images 1110, 1112, and 1114 areinput to an ANN. The ANN can be a deep ANN, such as deep ANN 1116. ANN1116 can be trained to extract a multi-magnification feature vector 1128a, 1128 b, 1128 c (collectively referred to as 1128) or class 1140 a,1140 b, 1140 c (collectively referred to as 1140) for each plurality ofsub-images, respectively. The ANN 1116 can include a plurality ofconvolution and pooling blocks 1120 a, 1120 b, and 1120 c (collectivelyreferred to as 1120).

Similar to the convolution and pooling blocks 1020 of FIG. 10 , in someembodiments, the number of convolution and pooling blocks 1120 cancorrespond to the number of different magnifications of the query image.That is, the plurality of sub-images can be grouped by magnificationlevels. Each group of sub-images having the same magnification level canbe input to a convolution and pooling block of the deep ANN 1016.Convolution and pooling operations of different groups of sub-images(i.e., different magnifications) can take place sequentially or inparallel. In the example of FIG. 11 , convolution and pooling operations1120 for different magnifications are shown as being parallel operationsat 1120 a, 1120 b and 1120 c to increase speed of the computationalprocess.

Autoencoders 1124 a, 1124 b, and 1124 c (collectively referred to as1124) can compress the extracted feature vectors of the last poolinglayers of 1120 a, 1120 b and 1120 c respectively. Each of theautoencoders 1124 a, 1124 b, and 1124 c can include a respective decoder1122 a, 1122 b, and 1122 c (collectively referred to as decoders 1122)that can be used during training of the ANN 1116. Autoencodingoperations of different groups of sub-images (i.e., differentmagnifications) can take place sequentially or in parallel. In theexample of FIG. 11 , autoencoding operations 1124 for differentmagnifications are shown as being parallel operations 1124 a, 1124 b,and 1124 c to increase speed of the computational process.

While both the convolution and pooling operations 1120 and theautoencoding operations 1124 are shown in FIG. 11 as being paralleloperations, in some embodiments, one or both of the convolution andpooling operations 1120 and the autoencoding operations 1124 can besequential operations.

The feature vectors obtained from the deepest (smallest) layer of theautoencoder 1124 a can be concatenated together to provide a singlefeature vector at 1128 a for each sub-image of the plurality ofsub-images 1110 for image 1104. The result is a set of feature vectors1128 a— a feature vector for each sub-image of the plurality ofsub-images 1110 for image 1104. Each feature vector of the set offeature vectors at 1128 a can also be fed into two fully connectedlayers 1134 a consisting of layers 1132 a followed by 1136 a to classifythe plurality of sub-images 1110 into one of n classes C1 a, C2 a, C3 a.. . Cna at 1140 a.

Similarly, the feature vectors obtained from the plurality of sub-images1112 of image 1106 can be concatenated together to provide a singlefeature vector 1128 b for each sub-image of the plurality of sub-images1112 for image 1106. The result is a set of vectors 1128 b— a featurevector for each sub-image of the plurality of sub-images 1112 for image1106. Each feature vector of the set of feature vectors at 1128 b canalso be fed into two fully connected layers 1134 b consisting of layers1132 b followed by 1136 b to classify the plurality of sub-images 1112into one of n classes C1 b, C2b, C3b, . . . Cnb at 1140 b.

The feature extraction and classification is repeated for the pluralityof sub-images 1114 of image 1108 as well. The feature vectors obtainedfrom the deepest (smallest) layer of the autoencoder 1124 c can beconcatenated together to provide a single feature vector at 1128 c foreach sub-image of the plurality of sub-images for image 1108. The resultis a set of feature vectors 1128 c— a feature vector for each sub-imageof the plurality of sub-images 1114 for image 1108. Each feature vectorof the set of feature vectors at 1128 c can also be fed into two fullyconnected layers 1134 c consisting of layers 1132 c followed by 1136 cto classify the plurality of sub-images 1114 into one of n classes C1c,C2c, C3c . . . Cnc at 1140 c. While two fully connected layers are shownin FIG. 11 for illustrative purposes, one or more fully connected layerscan be used.

The concatenated feature vectors at 1128 a, 1128 b, and 1128 c can beused to index the query image 1104. For example, the concatenatedfeature vectors 1128 a, 1128 b, 1128 c can be concatenated together(similar to 1028 of FIG. 10 above or 1310 of FIG. 13 below) to provide asingle feature vector for multiple magnifications (not shown in FIG. 11). That is, a single feature vector can include compressed (autoencoded)features of all magnifications 1124 a, 1124 b, and 1124 c. The singlefeature vector for multiple magnifications (not shown in FIG. 11 ) canalso be used in one or more fully connected layers to classify theinitial image 1104 into one of n classes: C1, C2, C3 . . . , Cn (similarto 1040 of FIG. 10 ).

The first fully connected layers 1140 a, 1140 b, and 1140 c of eachmagnification can also be used to index the query image 1104. Forexample, the classes 1140 a, 1140 b, and 1140 c of the plurality ofsub-images for each magnification can be concatenated together toprovide a single class for multiple magnifications of the initial image1104. A class for multiple magnifications of the initial image 1104 canhave a higher confidence than that of a class for a singlemagnification. That is, having the same class or prediction in multiplemagnifications can increase the confidence that the image characteristicis present in the image.

Referring now to FIG. 12 , shown therein is another example blockdiagram 1200 of an ANN that can be used to extract a feature vectorrepresentation of image characteristics of a query image at 408. Queryimage 1204 can be, for example, query image 502, 702, or 904. Whilequery image 1204 is shown in FIG. 12 as being a medical image forillustrative purposes, and in particular, a pathology image, the queryimage 1204 can be any type of image.

Query image 1204 can be stored in a format that includes additionalmagnification image layers, such as but not limited to a pyramidalformat. In such cases, steps to generate additional magnification images(e.g., sampling operations) are not necessary. Pyramidal formats cantypically store the initial image at an original magnification M, asecond magnification layer having a magnification of M/2, and a thirdmagnification layer having a magnification of M/4. For example, thepyramidal format of the query image 1204 shown in FIG. 12 includes theinitial image 1202 at the original magnification M, a secondmagnification layer 1206 at a second magnification such as M′ (which canbe lower than M), and a third magnification layer 1208 at a thirdmagnification such as M″ (which can be lower than M and M′). While onlythree magnification images 1202, 1206, and 1208 are shown in FIG. 12 forillustrative purposes, the query image can be stored in formats withfewer or more magnification images.

Each of the magnification image layers 1202, 1206, and 1208 can beindependently patched, clustered based on similarity as described inFIG. 3 resulting in a plurality of sub-images 1210 for pyramid imagelayer 1202, a plurality of sub-images 1212 for pyramidal image layer1206, and a plurality of sub-images 1214 for pyramidal image layer 1208.Each sub-image of the plurality of sub-images 1210, 1212, and 1214 canhave n×n pixels.

A plurality of sub-images 1210, 1212, and 1214 can be generated for eachof the pyramid image layers 1202, 1206 (i.e., version 1206 of imagelayer 1202), and 1208 (i.e., version 1208 of image layer 1202)independently at 406. That is, preliminary sub-images for each of imagelayers 1202, 1206, and 1208 can be independently selected. As describedabove, selecting preliminary sub-images can involve segmenting the imagelayer into sub-images, clustering the sub-images based on similarity,and selecting a mosaic of sub-images as preliminary sub-images torepresent the image layer. A set of anchor points for each image layer1202, 1206, and 1208 can be identified from the preliminary sub-imagesof each image layer 1202, 1206, and 1208 independently at 404. Eachsub-image of the plurality of sub-images 1210, 1212, and 1214 can haven×n pixels.

The sub-images from each plurality of sub-images 1210, 1212, and 1214can be input to an ANN. The ANN can be a deep ANN, such as deep ANN1216, can be trained to extract a multi-magnification feature vector1228 a, 1228 b, 1228 c (collectively referred to as 1228) or class 1240a, 1240 b, 1240 c (collectively referred to as 1240) for each pluralityof sub-images 1210, 1212, 1214, respectively. The ANN 1216 can include aplurality of convolution and pooling blocks 1220 a, 1220 b, and 1220 c(collectively referred to as 1220).

Similar to the convolution and pooling blocks 1020 of FIG. 10 and 1120of FIG. 11 , in some embodiments, the number of convolution and poolingblocks 1220 can correspond to the number of different magnificationslayers of the query image 1204. That is, the plurality of sub-images canbe grouped by magnification levels. Each group of sub-images having thesame magnification level can be input to a convolution and pooling blockof the deep ANN 1216. Convolution and pooling operations of differentgroups of sub-images (i.e., different magnifications) can take placesequentially or in parallel. In the example of FIG. 12 , convolution andpooling operations 1220 for different magnifications are shown as beingparallel operations at 1220 a, 1220 b and 1220 c to increase speed ofthe computational process.

Autoencoders 1224 a, 1224 b, and 1224 c (collectively referred to as1224) can compress the extracted feature vectors of the last poolinglayers of 1220 a, 1220 b and 1220 c respectively. Each of theautoencoders 1224 a, 1224 b, and 1224 c can include a respective decoder1222 a, 1222 b, and 1222 c (collectively referred to as decoders 1222)that can be used during training of the ANN 1216. Autoencodingoperations of different groups of sub-images (i.e., differentmagnifications) can take place sequentially or in parallel. In theexample of FIG. 12 , autoencoding operations 1224 for differentmagnifications are shown as being parallel operations 1224 a, 1224 b,and 1224 c to increase speed of the computational process.

While both the convolution and pooling operations 1220 and theautoencoding operations 1224 are shown in FIG. 12 as being paralleloperations, in some embodiments, one or both of the convolution andpooling operations 1220 and the autoencoding operations 1224 can besequential operations.

The feature vectors obtained from the deepest (smallest) layer of theautoencoder 1224 a can be concatenated together to provide a singlefeature vector at 1228 a for each sub-image of the plurality ofsub-images 1210 for image 1204. The result is a set of feature vectors1228 a— a feature vector for each sub-image of the plurality ofsub-images 1210 for image 1204. Each feature vector of the set offeature vectors at 1228 a can also be fed into two fully connectedlayers 1234 a consisting of layers 1232 a followed by 1236 a to classifythe plurality of sub-images 1210 into one of n classes C1 a, C2 a, C3aCna at 1240 a.

Similarly, the feature vectors obtained from the plurality of sub-images1212 of image 1206 can be concatenated together to provide a singlefeature vector 1228 b for each sub-image of the plurality of sub-images1212 for image 1206. The result is a set of vectors 1228 b— a featurevector for each sub-image of the plurality of sub-images 1212 for image1206. Each feature vector of the set of feature vectors at 1228 b canalso be fed into two fully connected layers 1234 b consisting of layers1232 b followed by 1236 b to classify the plurality of sub-images 1212into one of n classes C1b, C2b, C3b, Cnb at 1240 b.

The feature extraction and classification is repeated for the pluralityof sub-images 1214 of image 1208 as well. The feature vectors obtainedfrom the deepest (smallest) layer of the autoencoder 1224 c can beconcatenated together to provide a single feature vector at 1228 c foreach sub-image of the plurality of sub-images for image 1208. The resultis a set of feature vectors 1228 c— a feature vector for each sub-imageof the plurality of sub-images 1214 for image 1208. Each feature vectorof the set of feature vectors at 1228 c can also be fed into two fullyconnected layers 1234 c consisting of layers 1232 c followed by 1236 cto classify the plurality of sub-images 1214 into one of n classes C1c,C2c, C3c Cnc at 1240 c. While two fully connected layers are shown inFIG. 12 for illustrative purposes, one or more fully connected layerscan be used.

Either the concatenated feature vectors at 1228 a, 1228 b, and 1228 c orat the first fully connected layer 1240 a, 1240 b, and 1240 c can beused to index the query image 1204 stored in a pyramidal format.

The concatenated feature vectors at 1228 a, 1228 b, and 1228 c can beused to index the query image 1204 stored in a pyramidal format. Forexample, the concatenated feature vectors 1228 a, 1228 b, and 1228 c canbe concatenated together (similar to 1028 of FIG. 10 above or 1310 ofFIG. 13 below) to provide a single feature vector for multiplemagnifications (not shown in FIG. 12 ). That is, a single feature vectorcan include compressed (autoencoded) features of all magnifications 1224a, 1224 b, and 1224 c. The single feature vector for multiplemagnifications (not shown in FIG. 12 ) can also be used in one or morefully connected layers to classify the initial image 1204 into one of nclasses: C1, C2, C3 . . . , Cn (similar to 1040 of FIG. 10 ).

The first fully connected layers 1240 a, 1240 b, and 1240 c of eachmagnification can also be used to index the query image 1204. Forexample, the classes 1240 a, 1240 b, and 1240 c of the plurality ofsub-images for each magnification can be concatenated together toprovide a single class for multiple magnifications of the initial image1204. A class for multiple magnifications of the initial image 1204 canhave a higher confidence than that of a class for a singlemagnification. That is, having the same class or prediction in multiplemagnifications can increase the confidence that the image characteristicis present in the image.

Reference now is made to FIG. 13 , which shows an example block diagram1300 for generating an encoded representation based on feature vectorsextracted for a plurality of magnification levels. The generation of anencoded representation based on feature vectors extracted for aplurality of magnification levels can be, for example, used at 410 ofmethod 400 in FIG. 4 .

In some embodiments, an initial feature vector 1302 can include aplurality of initial feature vectors 1302 a, 1302 b, and 1302 c thateach represent images or sub-images having different magnifications M,M′, and M″ respectively. For example, sub-images having magnificationsM, M′, and M″ can be sub-images of the plurality of sub-images 1012 a,1012 b, and 1012 c in FIG. 10 , respectively. In additional examples,sub-images having magnifications M, M′, and M″ can be sub-images of theplurality of sub-images 1110, 1112, and 1114 of FIG. 11 respectively orthe plurality of sub-images 1210, 1212, and 1214 or FIG. 12respectively. Initial feature vectors 1302 a can be extracted from asub-image having magnification M, initial feature vectors 1302 b can beextracted from a sub-image having magnification M′ that is lower than M,and initial feature vectors 1302 c can be extracted from a sub-imagehaving magnification M″ that is lower than M and M′. For example,initial feature vectors 1302 a, 1302 b, and 1302 c can be featurevectors 1128 a, 1128 b, and 1128 c of FIG. 11 respectively or featurevectors 1228 a, 1228 b, and 1128 c of FIG. 12 respectively.

The number of initial feature vectors 1302 a, 1302 b, and 1302 c foreach magnification can be reduced. In some embodiments, a featureaggregator, such as feature aggregator 1304 of FIG. 13 , can reduce thenumber of initial feature vectors for each magnification to provide aplurality of intermediate feature vectors 1306 a, 1306 b, and 1306 c(collectively referred to as intermediate feature vector 1306). Forexample, initial feature vector 1302 a can include N feature vectors,such as 1302 a 1 to 1302 aN, and an intermediate feature vector 1306 acan include M feature vectors, such as 1306 a 1 to 1306 aM, in which Mis fewer than N.

In some embodiments, the feature aggregator 1304 can include separateengine blocks 1304 a, 1304 b, and 1304 c for each magnification. Thefeature aggregator 1304 can reduce the number of feature vectors byaggregating similar features. In some embodiments, aggregation caninvolve determining median feature vectors. The median feature vectorsof the group of similar feature vectors can be used to represent thegroup of similar feature vectors while the other feature vectors of thegroup of similar feature vectors can be discarded.

In some embodiments, determining a median feature vector can involvesorting a group of similar feature vectors f1, f2, . . . , fn todetermine a feature position for each feature vector within the group ofsimilar feature vectors. For each feature position, a median featurevalue can be determined. Together, the median feature value at eachfeature position can form the median feature vector. For example if eachfeature vector of a group of similar feature vectors has 1024 featurepositions, the median feature value at each feature position iscalculated, creating a new 1024 feature position vector that can be themedian feature vector for the group of similar feature vectors.

In some embodiments, aggregation can involve clustering techniques. Forexample, the N feature vectors can be clustered into a plurality ofclusters. A subset of feature vectors from each cluster can be selectedto represent that cluster. Each feature vector of the plurality ofsubsets can be used as an intermediate feature vector for themagnification. That is, the subset of feature vectors can be M, which isfewer than the N feature vectors that were clustered.

For example, to select a subset of feature vectors for a cluster, acenter of the cluster can be determined, and a distance between eachfeature vector of the cluster and the center of the cluster can becalculated. The occurrences of the distance between each feature vectorand the center of the cluster can be tabulated to generate a histogramfor the cluster. The histogram distribution can be used to select thesubset of feature vectors of the cluster.

In some embodiments, the number of intermediate feature vectors 1306 canbe further reduced. In some embodiments, a feature selector, such asfeature selector 1308 of FIG. 13 , can reduce the number of intermediatefeature vectors for each magnification to provide a reduced featurevector 1310 a, 1310 b, 1310 c (collectively referred to as reducedfeature vector 1310). In particular, feature selection can be used tocombine all feature vectors of the intermediate feature vectors into areduced feature vector. Various techniques for feature selection can beused, including but not limited to principal component analysis (PCA),autoencoders (Aes), and evolutionary optimization. For example,intermediate feature vector 1306 a can include M feature vectors, suchas 1306 a 1 to 1306 aM, and a reduced feature vector 1310 a is a singlefeature vector.

It should be noted that in some embodiments, a single feature vector canbe obtained from the initial feature vector directly. That is, theinitial feature vector 1302 can be fused by the feature selector 1304and the feature aggregator 1304 can be omitted.

The reduced feature vectors 1310 for each magnification, such as 1310 a,1310 b, and 1310 c can be concatenated together into a single featurevector 1310 to provide an image index representing multiplemagnifications of the entire image. In some embodiments, theconcatenated feature vector can be converted to a barcode.

At lower magnification levels, sub-images within an image can overlap.If the number of anchors is reduced, a fewer number of sub-images fromwhich to generate feature vectors would be available. Instead, imageidentifiers generated from sub-images for a plurality of magnificationlevels can provide more information—both finer details and largerstructure information at the same time—than image identifiers generatedfrom sub-images of a single magnification level. Furthermore, it can beadvantageous for an image identifier to include information captured atmultiple magnifications as this can allow for the search of digitalarchives for similar image data at multiple magnifications.

In medical imaging, and in particular in digital pathology, horizontalsearching relates to finding similar images within all organ types whilevertical searching relates to finding similar images within the sameorgan type. Both horizontal and vertical searching using imageidentifiers based on multiple magnifications can be more accuratebecause the similarity matching will be performed at multiplemagnifications.

Furthermore, a user can have more control over search parameters withimage identifiers based on multiple magnifications. For example, thesignificance of an individual magnification level can be set withrespect to a specific disease. That is, searching can be targeted withina specific magnification only (i.e., “single-magnification search”) oracross multiple magnifications (i.e., “multi-magnification search” or“pan-magnification match”).

Furthermore, multi-magnification and single-magnification searches canalso be combined. In some cases, the results of such a combined searchcan be more efficient and accurate. To combine the multi-magnificationand single-magnification searches, the searches can be performed insequence. That is, a single-magnification search can be followed by amulti-magnification search to enable a user to search from largerstructural information to finer detailed information. More specifically,the results of a single-magnification search can be further searchedwith multi-magnification. That is, a single-magnification search canfirst be performed to locate an initial set of similar images from adatabase or archive. Subsequently, a multi-magnification search can beperformed to locate similar images from the results of thesingle-magnification search (i.e., the initial set of similar images).For example, in digital pathology, it can be advantageous to firstconduct a search for tissue structure similarities followed by finerdetails of the tissue structure. Such sequential searching can enhancediagnostic accuracy and also simulate the traditional pathology. Thatis, sequential searching can simulate analysis using an analogmicroscope, as tissue slides at different magnifications are viewedmanually by moving different objectives in the optical path of theanalog microscope.

In addition, the multi-magnification search can be used to improve theaccuracy of single-magnification search, and vice versa. For example,the multi-magnification search and the single-magnification search canbe performed in parallel and the results of both searches can becompared with one another to identify common, or overlapping, results.Common or overlapping results can be identified as more accurateresults.

Referring now to FIG. 14 , an example method 1400 of locating imageswith similar image data as a query image is shown in a flowchartdiagram. An image management system, such as image management system 110having a processor 112 can be configured to implement method 1400.Method 1400 can be reiterated for each query image of the one or morequery images.

Method 1400 can begin at 1402, when the processor 112 obtains a queryimage, such as example query image 502, 702, 904, 1004, 1104, or 1204.Although query images 502, 702, 904, 1004, 1104, or 1204 as shown inFIG. 5A, 7, 9, and 10 to 12 as being medical images, and in particular,histopathology images, the query image can be any type of image. Forexample, the query image can be a satellite image.

Furthermore, the processor 112 can obtain one or more query images. Theone or more query images can be obtained from an imaging device 120, acomputing device 150, or a system storage component 140. The term “queryimage” used herein refers to an image for the purpose of using as aninput to operation performed by a processor, such as processor 112.

At 1404, the processor 112 can generate a plurality of sub-images withinthe query image for a plurality of magnification levels, similar to 406of method 400 in FIG. 4 . In some embodiments, the processor 112 caninclude a dedicated component, such as a patching component, forperforming 1404.

At 1406, the processor 112 can generate feature vectors representativeof image characteristics of the query image at the plurality ofmagnification levels from the plurality of sub-images. In someembodiments, the processor 112 can also generate classes representativeof image characteristics of the query image at the plurality ofmagnification levels from the plurality of sub-images. In someembodiments, the processor 112 can include an ANN for performing 1406.In some embodiments, 1406 can be similar to 408 of method 400 in FIG. 4.

At 1408, the processor 112 can generate an encoded representation formultiple magnifications of the query image based on the feature vectors,similar to 410 of method 400 in FIG. 4 . In some embodiments, theprocessor 112 can generate an encoded representation for multiplemagnifications of the query image based on the classes. In someembodiments, the processor 112 can include a dedicated component, suchas an indexing component, for performing 1408. The encodedrepresentation for multiple magnifications of the query image can beused as an image identifier for the query image.

At 1410, the processor 112 can locate similar images to the query imageusing the encoded representation for multiple magnifications of thequery image. In some embodiments, the processor 112 can include adedicated component, such as a searching component, for performing 1408.In some embodiments, similar images can be located based on imageidentifiers for images stored in a database, archive, or repositoryprovided by the storage component 114 or the system storage component140.

The search results, that is, the similar images located at 1410 can bedisplayed at a computing device 150 for review. In some embodiments, thesearch results can also include reports and metadata associated with theimages. For example, in the pathology context, reports and metadata canprovide information helpful for diagnosis.

It will be appreciated that numerous specific details are set forth inorder to provide a thorough understanding of the example embodimentsdescribed herein. However, it will be understood by those of ordinaryskill in the art that the embodiments described herein may be practicedwithout these specific details. In other instances, well-known methods,procedures and components have not been described in detail so as not toobscure the embodiments described herein. Furthermore, this descriptionand the drawings are not to be considered as limiting the scope of theembodiments described herein in any way, but rather as merely describingthe implementation of the various embodiments described herein.

It should be noted that terms of degree such as “substantially”, “about”and “approximately” when used herein mean a reasonable amount ofdeviation of the modified term such that the end result is notsignificantly changed. These terms of degree should be construed asincluding a deviation of the modified term if this deviation would notnegate the meaning of the term it modifies.

In addition, as used herein, the wording “and/or” is intended torepresent an inclusive-or. That is, “X and/or Y” is intended to mean Xor Y or both, for example. As a further example, “X, Y, and/or Z” isintended to mean X or Y or Z or any combination thereof.

It should be noted that the term “coupled” used herein indicates thattwo elements can be directly coupled to one another or coupled to oneanother through one or more intermediate elements.

The embodiments of the systems and methods described herein may beimplemented in hardware or software, or a combination of both. Theseembodiments may be implemented in computer programs executing onprogrammable computers, each computer including at least one processor,a data storage system (including volatile memory or non-volatile memoryor other data storage elements or a combination thereof), and at leastone communication interface. For example and without limitation, theprogrammable computers (referred to below as computing devices) may be aserver, network appliance, embedded device, computer expansion module, apersonal computer, laptop, personal data assistant, cellular telephone,smart-phone device, tablet computer, a wireless device or any othercomputing device capable of being configured to carry out the methodsdescribed herein.

In some embodiments, the communication interface may be a networkcommunication interface. In embodiments in which elements are combined,the communication interface may be a software communication interface,such as those for inter-process communication (IPC). In still otherembodiments, there may be a combination of communication interfacesimplemented as hardware, software, and combination thereof.

Program code may be applied to input data to perform the functionsdescribed herein and to generate output information. The outputinformation is applied to one or more output devices, in known fashion.

Each program may be implemented in a high level procedural or objectoriented programming and/or scripting language, or both, to communicatewith a computer system. However, the programs may be implemented inassembly or machine language, if desired. In any case, the language maybe a compiled or interpreted language. Each such computer program may bestored on a storage media or a device (e.g. ROM, magnetic disk, opticaldisc) readable by a general or special purpose programmable computer,for configuring and operating the computer when the storage media ordevice is read by the computer to perform the procedures describedherein. Embodiments of the system may also be considered to beimplemented as a non-transitory computer-readable storage medium,configured with a computer program, where the storage medium soconfigured causes a computer to operate in a specific and predefinedmanner to perform the functions described herein.

Furthermore, the system, processes and methods of the describedembodiments are capable of being distributed in a computer programproduct comprising a computer readable medium that bears computer usableinstructions for one or more processors. The medium may be provided invarious forms, including one or more diskettes, compact disks, tapes,chips, wireline transmissions, satellite transmissions, internettransmission or downloadings, magnetic and electronic storage media,digital and analog signals, and the like. The computer useableinstructions may also be in various forms, including compiled andnon-compiled code.

Various embodiments have been described herein by way of example only.Various modification and variations may be made to these exampleembodiments without departing from the spirit and scope of theinvention, which is limited only by the appended claims. Also, in thevarious user interfaces illustrated in the drawings, it will beunderstood that the illustrated user interface text and controls areprovided as examples only and are not meant to be limiting. Othersuitable user interface elements may be possible.

1.-82. (canceled)
 83. A computer-implemented method of generating animage identifier for multiple magnifications of one or more queryimages, the method comprising operating a processor to, for each queryimage: obtain the query image having an initial magnification level;generate a plurality of sub-images for a plurality of magnificationlevels, at least one sub-image corresponding to each magnification levelof the plurality of magnification levels; for each magnification level,apply an artificial neural network model to repeatedly pool andconvolute a group of sub-images to extract and aggregate feature vectorsrepresentative of image characteristics of the query image at thatmagnification level; and obtain a feature vector by compressing thefeature vectors for that magnification level; and generate the imageidentifier for multiple magnifications of the query image based on thecompressed feature vectors obtained for the plurality of magnificationlevels.
 84. The method of claim 83 further comprising operating theprocessor to locate similar images using the image identifier formultiple magnifications.
 85. The method of claim 84 wherein using theimage identifier for multiple magnifications comprises using a portionof the image identifier for multiple magnifications as an imageidentifier for a single magnification.
 86. The method of claim 84wherein operating the processor to locate similar images using the imageidentifier for multiple magnifications comprises operating the processorto: locate an initial set of images using a portion of the imageidentifier for multiple magnifications as an image identifier for asingle magnification; and locate the similar images from the initial setof images using the image identifier for multiple magnifications. 87.The method of claim 83 wherein each sub-image of the plurality ofsub-images for the plurality of magnification levels consists of anequal number of pixels as other sub-images of the plurality ofsub-images.
 88. The method of claim 83 wherein each sub-image of theplurality of sub-images for the plurality of magnification levelscomprises same dimensions as other sub-images of the plurality ofsub-images, the dimensions being characterized by pixels.
 89. A systemfor generating an image identifier for multiple magnifications of one ormore query images, the system comprising: a communication component toprovide access to the one or more images via a network; and a processorin communication with the communication component, the processor beingoperable to, for each query image: obtain the query image having aninitial magnification level; generate a plurality of sub-images for aplurality of magnification levels, at least one sub-image correspondingto each magnification level of the plurality of magnification levels;for each magnification level, apply an artificial neural network modelto repeatedly pool and convolute a group of sub-images to extract andaggregate feature vectors representative of image characteristics of thequery image at that magnification level; and obtain a feature vector bycompressing the feature vectors for that magnification level; andgenerate the image identifier for multiple magnifications of the queryimage based on the compressed feature vectors obtained for the pluralityof magnification levels.
 90. A computer-implemented method of generatingan image identifier for multiple magnifications of one or more queryimages, the method comprising operating a processor to, for each queryimage: obtain the query image having an initial magnification level;generate a plurality of sub-images for a plurality of magnificationlevels, at least one sub-image corresponding to each magnification levelof the plurality of magnification levels; apply an artificial neuralnetwork model to the plurality of sub-images to extract feature vectorsrepresentative of image characteristics of the query image at thatmagnification level; for each magnification level of the plurality ofmagnification levels, reduce a number of feature vectors for thatmagnification level; and generate the image identifier for multiplemagnifications of the query image based on the feature vectors extractedfrom the plurality of magnification levels.
 91. The method of claim 90further comprising operating the processor to locate similar imagesusing the image identifier for multiple magnifications.
 92. The methodof claim 91 wherein using the image identifier for multiplemagnifications comprises using a portion of the image identifier formultiple magnifications as an image identifier for a singlemagnification.
 93. The method of claim 91 wherein operating theprocessor to locate similar images using the image identifier formultiple magnifications comprises operating the processor to: locate aninitial set of images using a portion of the image identifier formultiple magnifications as an image identifier for a singlemagnification; and locate the similar images from the initial set ofimages using the image identifier for multiple magnifications.
 94. Themethod of claim 90 wherein each sub-image of the plurality of sub-imagesfor the plurality of magnification levels consists of an equal number ofpixels as other sub-images of the plurality of sub-images.
 95. Themethod of claim 90 wherein each sub-image of the plurality of sub-imagesfor the plurality of magnification levels comprises same dimensions asother sub-images of the plurality of sub-images, the dimensions beingcharacterized by pixels.
 96. The method of claim 90 wherein operatingthe processor to generate the plurality of sub-images for the pluralityof magnification levels comprises operating the processor to generate aplurality of concentric sub-images for the plurality of magnificationlevels.
 97. A system for generating an image identifier for multiplemagnifications of one or more query images, the system comprising: acommunication component to provide access to the one or more images viaa network; and a processor in communication with the communicationcomponent, the processor being operable to, for each query image: obtainthe query image having an initial magnification level; generate aplurality of sub-images for a plurality of magnification levels, atleast one sub-image corresponding to each magnification level of theplurality of magnification levels; apply an artificial neural networkmodel to the plurality of sub-images to extract feature vectorsrepresentative of image characteristics of the query image at theplurality of magnification levels from the plurality of sub-images; foreach magnification level of the plurality of magnification levels,reduce a number of feature vectors for that magnification level; andgenerate the image identifier for multiple magnifications of the queryimage based on the feature vectors extracted from the plurality ofsub-images for the plurality of magnification levels.
 98. The system ofclaim 97 wherein the processor is further operable to locate similarimages using the image identifier for multiple magnifications.
 99. Thesystem of claim 98 wherein the processor being operable to use the imageidentifier for multiple magnifications comprises the processor beingoperable to use a portion of the image identifier for multiplemagnifications as an image identifier for a single magnification. 100.The system of claim 98 wherein the processor being operable to locatesimilar images using the image identifier for multiple magnificationscomprises the processor being operable to: locate an initial set ofimages using a portion of the image identifier for multiplemagnifications as an image identifier for a single magnification; andlocate the similar images from the initial set of images using the imageidentifier for multiple magnifications.
 101. The system of claim 97wherein each sub-image of the plurality of sub-images for the pluralityof magnification levels consists of an equal number of pixels as othersub-images of the plurality of sub-images.
 102. The system of claim 97wherein each sub-image of the plurality of sub-images for the pluralityof magnification levels comprises same dimensions as other sub-images ofthe plurality of sub-images, the dimensions being characterized bypixels.